An improved bound for the monochromatic cycle partition number

DOI10.1016/j.jctb.2006.02.007zbMath1115.05031OpenAlexW2126525415WikidataQ105962026 ScholiaQ105962026MaRDI QIDQ859613

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

Publication date: 16 January 2007

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2006.02.007

zbMATH Keywords

edge-coloring regularity lemma complete graph monochromatic partition

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items

Ramsey number of paths and connected matchings in Ore-type host graphs, 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, Vertex covering with monochromatic pieces of few colours, Partitioning infinite hypergraphs into few monochromatic Berge-paths, Decompositions of edge-coloured infinite complete graphs into monochromatic paths. II, Improved monochromatic loose cycle partitions in hypergraphs, Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles, Partitioning edge-coloured complete graphs into monochromatic cycles and paths, Monochromatic loose-cycle partitions in hypergraphs, Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles, Heterochromatic tree partition problem in complete tripartite graphs, Problems close to my heart, Vertex partitions of non-complete graphs into connected monochromatic $k$-regular graphs, A note on the saturation number of the family of $k$-connected graphs, Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles, Local colourings and monochromatic partitions in complete bipartite graphs, Monochromatic partitions in local edge colorings, Minimum degree conditions for monochromatic cycle partitioning, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Partitioning 2-edge-colored graphs by monochromatic paths and cycles, Monochromatic cycle partitions of $2$-coloured graphs with minimum degree $3n/4$, Monochromatic bounded degree subgraph partitions, Partitioning random graphs into monochromatic components, Heterochromatic tree partition number in complete multipartite graphs, Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs, Partitioning complete graphs by heterochromatic trees, An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs, Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture, Unnamed Item, Partitioning 2-Edge-Colored Ore-Type Graphs by Monochromatic Cycles, The 3-Colour Ramsey Number of a 3-Uniform Berge Cycle, Local colourings and monochromatic partitions in complete bipartite graphs, Covering graphs by monochromatic trees and Helly-type results for hypergraphs, Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey, 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 Edge-Colored Hypergraphs into Few Monochromatic Tight Cycles, Towards Lehel's conjecture for 4-uniform tight cycles, Almost Partitioning a 3-Edge-Colored $K_{n,n}$ into Five Monochromatic Cycles

Cites Work