Monochromatic cycle partitions of \(2\)-coloured graphs with minimum degree \(3n/4\)

zbMath1406.05067arXiv1502.07736MaRDI QIDQ668072

Shoham Letzter

Publication date: 5 March 2019

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

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

zbMATH Keywords

absorbingregularity lemmarobust expansionmonochromatic partitioningRamsey-type problem

Mathematics Subject Classification ID

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

Related Items (9)

Vertex covers by monochromatic pieces -- a survey of results and problems ⋮ Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles ⋮ On sufficient conditions for spanning structures in dense graphs ⋮ Minimum degree conditions for monochromatic cycle partitioning ⋮ Monochromatic cycle partitions of \(2\)-coloured graphs with minimum degree \(3n/4\) ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Monochromatic cycle partitions of graphs with large minimum degree
• 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
• Monochromatic cycle partitions of \(2\)-coloured graphs with minimum degree \(3n/4\)
• 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
• Vertex coverings by monochromatic cycles and trees
• \(R(C_n,C_n,C_n)\leqq (4+o(1))n\)
• Blow-up lemma
• Partitioning a graph into a cycle and a sparse graph
• Pancyclic graphs. I
• On Hamilton's ideals
• Monochromatic Cycles in 2-Coloured Graphs
• Star Versus Two Stripes Ramsey Numbers and a Conjecture of Schelp
• On maximal paths and circuits of graphs
• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles
• Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles
• Vertex coverings by monochromatic paths and cycles

This page was built for publication: Monochromatic cycle partitions of \(2\)-coloured graphs with minimum degree \(3n/4\)