Gabriel Collado

collaborators

2 papers

math.CO2026

Forcing monochromatic subdivisions

Gabriel Collado, Dhruv Mubayi

We prove that for every integers $d \geq 1$ and $s \geq 2$ there exists an integer $D$ , that depends only on $d$ and $s$ , such that for every graph $P$ with maximum degree at most $d$ …

math.CO2024

Packing independent cliques into planar graphs

Csaba Biró, Gabriel Collado, Oscar Zamora

The indeque number of a graph is largest set of vertices that induce an independent set of cliques. We study the extremal value of this parameter for the class and subclasses of pl…