10 citations · 21 across the 8 of their papers we have counts for
4 papers · 1 filter
Monochromatic cycle covers in random graphs
Dániel Korándi, Frank Mousset, Rajko Nenadov +2
A classic result of Erdős, Gyárfás and Pyber states that for every coloring of the edges of with colors, there is a cover of its vertex set by at most $f(r) = O(r^2 \log…
On the Turán number of ordered forests
Dániel Korándi, Gábor Tardos, István Tomon +1
An ordered graph is a simple graph with a linear order on its vertex set. The corresponding Turán problem, first studied by Pach and Tardos, asks for the maximum number $\text{…
Rainbow saturation and graph capacities
Dániel Korándi
The -colored rainbow saturation number is the minimum size of a -edge-colored graph on vertices that contains no rainbow copy of , but the addition of an…
On the Turán number of some ordered even cycles
Ervin Győri, Dániel Korándi, Abhishek Methuku +3
A classical result of Bondy and Simonovits in extremal graph theory states that if a graph on vertices contains no cycle of length then it has at most edges…