13 citations · 74 across the 20 of their papers we have counts for
4 papers · 1 filter
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…
Decomposing tournaments into paths
Allan Lo, Viresh Patel, Jozef Skokan +1
We consider a generalisation of Kelly's conjecture which is due to Alspach, Mason, and Pullman from 1976. Kelly's conjecture states that every regular tournament has an edge decomp…
The Ramsey Number of Fano Plane Versus Tight Path
József Balogh, Felix Christian Clemen, Jozef Skokan +1
The hypergraph Ramsey number of two -uniform hypergraphs and , denoted by , is the least integer such that every red-blue edge-coloring of the complete -un…
Regularity inheritance in hypergraphs
Peter Allen, Ewan Davies, Jozef Skokan
We give a new approach to handling hypergraph regularity. This approach allows for vertex-by-vertex embedding into regular partitions of hypergraphs, and generalises to regular par…