Partitioning 3-colored complete graphs into three monochromatic cycles

zbMath1217.05185MaRDI QIDQ540032

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

Publication date: 1 June 2011

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.emis.de/journals/EJC/Volume_18/Abstracts/v18i1p53.html

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Related Items (25)

Vertex covers by monochromatic pieces -- a survey of results and problems ⋮ Monochromatic cycle power partitions ⋮ Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles ⋮ Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles ⋮ Monochromatic Cycle Partitions in Local Edge Colorings ⋮ Monochromatic cycle partitions of graphs with large minimum degree ⋮ Improved monochromatic loose cycle partitions in hypergraphs ⋮ Partitioning edge-coloured complete graphs into monochromatic cycles and paths ⋮ Monochromatic loose-cycle partitions in hypergraphs ⋮ Monochromatic paths in 2-edge-coloured graphs and hypergraphs ⋮ Local colourings and monochromatic partitions in complete bipartite graphs ⋮ Monochromatic partitions in local edge colorings ⋮ Partitioning 2-edge-colored graphs by monochromatic paths and cycles ⋮ Coverings by few monochromatic pieces: a transition between two Ramsey problems ⋮ Monochromatic cycle partitions of \(2\)-coloured graphs with minimum degree \(3n/4\) ⋮ Monochromatic bounded degree subgraph partitions ⋮ Unnamed Item ⋮ Partitioning 2-Edge-Colored Ore-Type Graphs by Monochromatic Cycles ⋮ Local colourings and monochromatic partitions in complete bipartite graphs ⋮ Matchings with few colors in colored complete graphs and hypergraphs ⋮ Ramsey Number of a Connected Triangle Matching ⋮ Monochromatic square-cycle and square-path partitions ⋮ Monochromatic cycle partitions in random graphs ⋮ Partitioning a graph into a cycle and a sparse graph ⋮ Almost Partitioning a 3-Edge-Colored $K_{n,n}$ into Five Monochromatic Cycles

This page was built for publication: Partitioning 3-colored complete graphs into three monochromatic cycles