3 papers
math.CO2020
Powers of paths in tournaments
Nemanja Draganić, François Dross, Jacob Fox +7
In this short note we prove that every tournament contains the -th power of a directed path of linear length. This improves upon recent results of Yuster and of Girão. We also g…
math.CO2019
Minimum degree conditions for monochromatic cycle partitioning
Dániel Korándi, Richard Lang, Shoham Letzter +1
A classical result of Erdős, Gyárfás and Pyber states that any -edge-coloured complete graph has a partition into monochromatic cycles. Here we determine the min…
math.CO2018
Improved Ramsey-type results for comparability graphs
Dániel Korándi, István Tomon
Several discrete geometry problems are equivalent to estimating the size of the largest homogeneous sets in graphs that happen to be the union of few comparability graphs. An impor…