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 $r$-edge-coloured complete graph has a partition into $O(r^2\log r)$ monochromatic cycles. Here we determine the min…