6 citations · 10 across the 4 of their papers we have counts for
6 papers
Powers of paths and cycles in tournaments
António Girão, Dániel Korándi, Alex Scott
We show that for every positive integer , any tournament can be partitioned into at most -th powers of paths. This result is tight up to the exponential constant. Mo…
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…
Exact stability for Turán's Theorem
Dániel Korándi, Alexander Roberts, Alex Scott
Turán's Theorem says that an extremal -free graph is -partite. The Stability Theorem of Erdős and Simonovits shows that if a -free graph with vertices has…
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…
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…
Separating path systems
Victor Falgas-Ravry, Teeradej Kittipassorn, Dániel Korándi +2
We study separating systems of the edges of a graph where each member of the separating system is a path. We conjecture that every -vertex graph admits a separating path system…