Partitioning 3-colored complete graphs into three monochromatic cycles

András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi

Research output: Article

23 Citations (Scopus)

Abstract

We show in this paper that in every 3-coloring of the edges of Kn all but o(n) of its vertices can be partitioned into three monochromatic cycles. From this, using our earlier results, actually it follows that we can partition all the vertices into at most 17 monochromatic cycles, improving the best known bounds. If the colors of the three monochromatic cycles must be different then one can cover (3/4 - o(1))n vertices and this is close to best possible.

Original languageEnglish
Pages (from-to)1-16
Number of pages16
JournalElectronic Journal of Combinatorics
Volume18
Issue number1
Publication statusPublished - márc. 28 2011

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics
  • Applied Mathematics

Cite this