Monochromatic loose-cycle partitions in hypergraphs
From MaRDI portal
Publication:405239
zbMath1300.05199MaRDI QIDQ405239
András Gyárfás, Gábor N. Sárközy
Publication date: 4 September 2014
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i2p36
Hypergraphs (05C65) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Vertex covers by monochromatic pieces -- a survey of results and problems, Monochromatic loose path partitions in \(k\)-uniform hypergraphs, Partitioning infinite hypergraphs into few monochromatic Berge-paths, Cover \(k\)-uniform hypergraphs by monochromatic loose paths, Monochromatic paths in 2-edge-coloured graphs and hypergraphs, Minimum degree conditions for monochromatic cycle partitioning, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Partitioning 2-coloured complete \(k\)-uniform hypergraphs into monochromatic \(\ell\)-cycles, A note on the linear cycle cover conjecture of Gyárfás and Sárközy, Partitioning Edge-Colored Hypergraphs into Few Monochromatic Tight Cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Partitioning edge-coloured complete graphs into monochromatic cycles and paths
- Partitioning 3-colored complete graphs into three monochromatic cycles
- 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
- On the Ramsey number of sparse 3-graphs
- Vertex coverings by monochromatic cycles and trees
- Monochromatic path and cycle partitions in hypergraphs
- 3-uniform hypergraphs of bounded degree have linear Ramsey numbers
- 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
- Hamiltonian chains in hypergraphs
- Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles
- Ramsey numbers of sparse hypergraphs
