Partitioning 3-colored complete graphs into three monochromatic cycles

Gyárfás, András and Ruszinkó, Miklós and Sárközy, Gábor and Szemerédi, Endre (2011) Partitioning 3-colored complete graphs into three monochromatic cycles. ELECTRONIC JOURNAL OF COMBINATORICS, 18. pp. 1-16. ISSN 1077-8926

Preview

Text Partitioning 3-colored complete graphs into three monochromatic cycles.pdf Download (169kB) | Preview

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.

Actions (login required)

Edit Item