Almost Partitioning a 3-Edge-Colored $K_{n,n}$ into Five Monochromatic Cycles
DOI10.1137/15M104222XzbMath1365.05222arXiv1510.00060MaRDI QIDQ5270411
Oliver Schaudt, Richard Lang, Maya Jakobine Stein
Publication date: 23 June 2017
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1510.00060
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) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Ramsey theory (05D10)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles
- Monochromatic cycle partitions of graphs with large minimum degree
- Partitioning edge-coloured complete graphs into monochromatic cycles and paths
- 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
- Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture
- Perfect matchings in large uniform hypergraphs with large minimum collective degree
- Stability of the path-path Ramsey number
- 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
- Partitioning a graph into a cycle and a sparse graph
- Corrigendum. Three-color Ramsey numbers for paths
- 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
- Holes in graphs
- Local colourings and monochromatic partitions in complete bipartite graphs
This page was built for publication: Almost Partitioning a 3-Edge-Colored $K_{n,n}$ into Five Monochromatic Cycles
