11 citations · 28 across the 4 of their papers we have counts for
5 papers
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…
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…
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…
Partitioning -coloured complete -uniform hypergraphs into monochromatic -cycles
Sebastian Bustamante, Maya Stein
We show that for all with and dividing the following hypergraph-variant of Lehel's conjecture is true. Every -edge-colouring of the $…
Monochromatic tree covers and Ramsey numbers for set-coloured graphs
Sebastián Bustamante, Maya Stein
We consider a generalisation of the classical Ramsey theory setting to a setting where each of the edges of the underlying host graph is coloured with a {\em set} of colours (inste…