Hostname: page-component-8448b6f56d-c47g7 Total loading time: 0 Render date: 2024-04-24T05:16:28.836Z Has data issue: false hasContentIssue false
  • English
  • Français

Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles

Published online by Cambridge University Press:  01 December 1998

TOMASZ ŁUCZAK ,
VOJTĚCH RÖDL  and
ENDRE SZEMERÉDI
TOMASZ ŁUCZAK
Affiliation:
Department of Discrete Mathematics, Adam Mickiewicz University, Poznán, Poland, and Department of Mathematics and Computer Science, Emory University, Atlanta, Georgia 30322, USA (e-mail: tomasz@amu.edu.pl)
VOJTĚCH RÖDL
Affiliation:
Department of Mathematics and Computer Science, Emory University, Atlanta, Georgia 30322, USA (e-mail: rodl@mathcs.emory.edu)
ENDRE SZEMERÉDI
Affiliation:
Department of Computer Science, Rutgers University, New Brunswick, NJ 08903, USA (e-mail: szemered@cs.rutgers.edu)
Get access Rights & Permissions [Opens in a new window]

Abstract

We prove that there exists n0, such that, for every n[ges ]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.

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 7 , Issue 4 , December 1998 , pp. 423 - 436
Copyright
1998 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)