Minimum degree conditions for monochromatic cycle partitioning
From MaRDI portal
Publication:2221921
DOI10.1016/j.jctb.2020.07.005zbMath1457.05113arXiv1902.05882OpenAlexW3082955440MaRDI QIDQ2221921
Dániel Korándi, Richard Lang, Shoham Letzter, Alexey Pokrovskiy
Publication date: 3 February 2021
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1902.05882
Coloring of graphs and hypergraphs (05C15) Ramsey theory (05D10) Eulerian and Hamiltonian graphs (05C45)
Related Items (6)
Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles ⋮ Properly colored cycles of different lengths in edge-colored complete graphs ⋮ An improvement on Łuczak's connected matchings method ⋮ Covering graphs by monochromatic trees and Helly-type results for hypergraphs ⋮ Monochromatic square-cycle and square-path partitions ⋮ Monochromatic cycle partitions in random graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Vertex covers by monochromatic pieces -- a survey of results and problems
- Monochromatic cycle partitions of graphs with large minimum degree
- Partitioning edge-coloured complete graphs into monochromatic cycles and paths
- Monochromatic loose-cycle partitions in hypergraphs
- Partitioning 2-edge-colored graphs by monochromatic paths and cycles
- Monochromatic bounded degree subgraph partitions
- Monochromatic cycle partitions of \(2\)-coloured graphs with minimum degree \(3n/4\)
- An improved bound for the monochromatic cycle partition number
- Proof of the bandwidth conjecture of Bollobás and Komlós
- 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\)
- Partitioning complete bipartite graphs by monochromatic cycles
- Blow-up lemma
- Vertex partitions by connected monochromatic \(k\)-regular graphs
- Cycles of even length in graphs
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Decompositions of edge-colored infinite complete graphs into monochromatic paths
- Rainbow matchings and cycle-free partial transversals of Latin squares
- Monochromatic cycle partitions of edge-colored graphs
- Monochromatic Cycle Partitions in Local Edge Colorings
- Monochromatic Paths in Graphs
- Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles
- Hamilton cycles in graphs and hypergraphs: an extremal perspective
- Monochromatic cycle covers in random graphs
- Vertex coverings by monochromatic paths and cycles
- Proof of the 1-factorization and Hamilton Decomposition Conjectures
- Almost partitioning 2‐colored complete 3‐uniform hypergraphs into two monochromatic tight or loose cycles
- Partitioning Edge-Colored Hypergraphs into Few Monochromatic Tight Cycles
This page was built for publication: Minimum degree conditions for monochromatic cycle partitioning
