Improved monochromatic loose cycle partitions in hypergraphs
From MaRDI portal
Publication:396737
DOI10.1016/j.disc.2014.06.025zbMath1298.05239OpenAlexW2158456392MaRDI QIDQ396737
Publication date: 14 August 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2014.06.025
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (13)
Vertex covers by monochromatic pieces -- a survey of results and problems ⋮ Monochromatic cycle power partitions ⋮ Monochromatic loose path partitions in \(k\)-uniform hypergraphs ⋮ Partitioning infinite hypergraphs into few monochromatic Berge-paths ⋮ Mixed covering arrays on 3-uniform hypergraphs ⋮ Cover \(k\)-uniform hypergraphs by monochromatic loose paths ⋮ Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles ⋮ Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Monochromatic bounded degree subgraph partitions ⋮ Monochromatic square-cycle and square-path partitions ⋮ Partitioning Edge-Colored Hypergraphs into Few Monochromatic Tight Cycles ⋮ Towards Lehel's conjecture for 4-uniform tight cycles
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Loose Hamilton cycles in hypergraphs
- The Ramsey number for hypergraph cycles. I.
- An improved bound for the monochromatic cycle partition number
- An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
- Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture
- The Ramsey number of diamond-matchings and loose cycles in hypergraphs
- 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
- Monochromatic path and cycle partitions in hypergraphs
- Three-color Ramsey numbers for paths
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Monochromatic cycle partitions of edge-colored graphs
- A hypergraph blow-up lemma
- Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles
- Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles
- An algorithmic version of the blow-up lemma
- Regularity Lemma for k-uniform hypergraphs
- An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs
- Regular Partitions of Hypergraphs: Regularity Lemmas
This page was built for publication: Improved monochromatic loose cycle partitions in hypergraphs
