Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles

Tomasz Łuczak, Vojtěch Rödl, Endre Szemerédi

Research output: Contribution to journalArticle

45 Citations (Scopus)


We prove that there exists n0, such that, for every n ≥caret; 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.

Original languageEnglish
Pages (from-to)423-436
Number of pages14
JournalCombinatorics Probability and Computing
Issue number4
Publication statusPublished - Jan 1 1998

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Statistics and Probability
  • Computational Theory and Mathematics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles'. Together they form a unique fingerprint.

  • Cite this