Partitioning Edge-Colored Hypergraphs into Few Monochromatic Tight Cycles
From MaRDI portal
Publication:5854893
DOI10.1137/19M1269786zbMath1459.05253arXiv1903.04471OpenAlexW2922201699MaRDI QIDQ5854893
Sebastián Bustamante, Alexey Pokrovskiy, Jozef Skokan, Nóra Frankl, Jan Corsten
Publication date: 12 March 2021
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1903.04471
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) Coloring of graphs and hypergraphs (05C15)
Related Items (5)
Partitioning infinite hypergraphs into few monochromatic Berge-paths ⋮ Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles ⋮ Minimum degree conditions for monochromatic cycle partitioning ⋮ Monochromatic square-cycle and square-path partitions ⋮ Towards Lehel's conjecture for 4-uniform tight cycles
Cites Work
- Unnamed Item
- Vertex covers by monochromatic pieces -- a survey of results and problems
- Improved monochromatic loose cycle partitions in hypergraphs
- Partitioning edge-coloured complete graphs into monochromatic cycles and paths
- Monochromatic loose-cycle partitions in hypergraphs
- Monochromatic bounded degree subgraph partitions
- An improved bound for the monochromatic cycle partition number
- Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture
- Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs
- Vertex coverings by monochromatic cycles and trees
- Monochromatic path and cycle partitions in hypergraphs
- Monochromatic cycle power partitions
- Decompositions of edge-colored infinite complete graphs into monochromatic paths
- Monochromatic cycle partitions of edge-colored graphs
- Linear Ramsey Numbers for Bounded-Degree Hypergrahps
- Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles
- Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles
- Regular Partitions of Hypergraphs: Regularity Lemmas
- Ramsey numbers of sparse hypergraphs
This page was built for publication: Partitioning Edge-Colored Hypergraphs into Few Monochromatic Tight Cycles
