Sebastián Bustamante

collaborators

2 papers

math.CO2019

Partitioning infinite hypergraphs into few monochromatic Berge-paths

Sebastián Bustamante, Jan Corsten, Nóra Frankl

Extending a result of Rado to hypergraphs, we prove that for all $s, k, t \in N$ with $k \geq t \geq 2$ , the vertices of every $r = s (k - t + 1)$ -edge-coloured countably infin…

math.CO2019

Partitioning edge-coloured hypergraphs into few monochromatic tight cycles

Sebastián Bustamante, Jan Corsten, Nóra Frankl +2

Confirming a conjecture of Gyárfás, we prove that, for all natural numbers $k$ and $r$ , the vertices of every $r$ -edge-coloured complete $k$ -uniform hypergraph can be partitioned i…