### Abstract

We prove that there exists n_{0}, such that, for every n ≥caret; n_{0} and every 2-colouring of the edges of the complete graph K_{n}, one can find two vertex-disjoint monochromatic cycles of different colours which cover all vertices of K_{n}.

Original language | English |
---|---|

Pages (from-to) | 423-436 |

Number of pages | 14 |

Journal | Combinatorics Probability and Computing |

Volume | 7 |

Issue number | 4 |

DOIs | |

Publication status | Published - 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

Łuczak, T., Rödl, V., & Szemerédi, E. (1998). Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles.

*Combinatorics Probability and Computing*,*7*(4), 423-436. https://doi.org/10.1017/S0963548398003599