Monochromatic cycle partitions of graphs with large minimum degree

DOI10.1016/J.JCTB.2016.08.006zbMath1350.05135arXiv1409.1874OpenAlexW2963975174MaRDI QIDQ345114

Luke L. Nelsen, Louis DeBiasio

Publication date: 25 November 2016

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

Full work available at URL: https://arxiv.org/abs/1409.1874

zbMATH Keywords

absorbingregularity lemmarobust expansionmonochromatic partitioningRamsey-type problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Ramsey theory (05D10) Vertex degrees (05C07)

Related Items (15)

Cycle partitions of regular graphs ⋮ Vertex covers by monochromatic pieces -- a survey of results and problems ⋮ Large monochromatic components in edge colored graphs with a minimum degree condition ⋮ Vertex covering with monochromatic pieces of few colours ⋮ Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles ⋮ Minimum degree conditions for monochromatic cycle partitioning ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Monochromatic cycle partitions of \(2\)-coloured graphs with minimum degree \(3n/4\) ⋮ Partitioning random graphs into monochromatic components ⋮ Partitioning 2-Edge-Colored Ore-Type Graphs by Monochromatic Cycles ⋮ Monochromatic square-cycle and square-path partitions ⋮ Spanning Trees with Few Branch Vertices ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partitioning edge-coloured complete graphs into monochromatic cycles and paths
• Some Ramsey-Turán type problems and related questions
• Partitioning 2-edge-colored graphs by monochromatic paths and cycles
• Partitioning 3-colored complete graphs into three monochromatic cycles
• An improved bound for the monochromatic cycle partition number
• How to avoid using the regularity Lemma: Pósa's conjecture revisited
• Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture
• Hamiltonian degree sequences in digraphs
• Stability of the path-path Ramsey number
• On the circumference of a graph and its complement
• Vertex coverings by monochromatic cycles and trees
• All Ramsey numbers for cycles in graphs
• \(R(C_n,C_n,C_n)\leqq (4+o(1))n\)
• On Hamilton's ideals
• On a Ramsey-type problem of J. A. Bondy and P. Erdős. II
• Monochromatic Cycles in 2-Coloured Graphs
• Star Versus Two Stripes Ramsey Numbers and a Conjecture of Schelp
• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles
• Embedding large subgraphs into dense graphs
• Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles
• Vertex coverings by monochromatic paths and cycles
• Cycle packing

This page was built for publication: Monochromatic cycle partitions of graphs with large minimum degree