11 citations · 28 across the 4 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
math.CO2019★ 11 cited
Clique immersions and independence number
Sebastián Bustamante, Daniel A. Quiroz, Maya Stein +1
The analogue of Hadwiger's conjecture for the immersion order states that every graph contains as an immersion. If true, it would imply that every graph with ver…
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 with , the vertices of every -edge-coloured countably infin…
math.CO2019★ 10 cited
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 and , the vertices of every -edge-coloured complete -uniform hypergraph can be partitioned i…