We prove that there exists n0, such that, for every n≥n0 and every 2-colouring of the edges of the complete graph Kn, one can find two vertex-disjoint monochromatic cycles of different colours which cover all vertices of Kn.
['Tomasz Łuczak', 'Vojtěch Rödl', 'Endre Szemerédi']
Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles