Monochromatic loose-cycle partitions in hypergraphs
zbMATH Open1300.05199MaRDI QIDQ405239FDOQ405239
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
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- Improved monochromatic loose cycle partitions in hypergraphs
- Monochromatic path and cycle partitions in hypergraphs
- Partitioning edge-colored hypergraphs into few monochromatic tight cycles
- Monochromatic cycle partitions of edge-colored graphs
- Almost partitioning 2-colored complete 3-uniform hypergraphs into two monochromatic tight or loose cycles
Paths and cycles (05C38) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- An improved bound for the monochromatic cycle partition number
- Hamiltonian chains in hypergraphs
- Vertex coverings by monochromatic cycles and trees
- Monochromatic path and cycle partitions in hypergraphs
- Monochromatic cycle partitions of edge-colored graphs
- Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles
- Partitioning edge-coloured complete graphs into monochromatic cycles and paths
- Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles
- Title not available (Why is that?)
- Partitioning 3-colored complete graphs into three monochromatic cycles
- Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture
- Title not available (Why is that?)
- Ramsey numbers of sparse hypergraphs
- Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs
- On the Ramsey number of sparse 3-graphs
- 3-uniform hypergraphs of bounded degree have linear Ramsey numbers
- Linear Ramsey Numbers for Bounded-Degree Hypergrahps
Cited In (13)
- Monochromatic partitions of complete uniform hypergraphs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Partitioning Edge-Colored Hypergraphs into Few Monochromatic Tight Cycles
- Minimum degree conditions for monochromatic cycle partitioning
- Vertex covers by monochromatic pieces -- a survey of results and problems
- A note on the linear cycle cover conjecture of Gyárfás and Sárközy
- Improved monochromatic loose cycle partitions in hypergraphs
- Monochromatic paths in 2-edge-coloured graphs and hypergraphs
- Monochromatic loose paths in multicolored $k$-uniform cliques
- Monochromatic loose path partitions in \(k\)-uniform hypergraphs
- Partitioning infinite hypergraphs into few monochromatic Berge-paths
- Partitioning 2-coloured complete \(k\)-uniform hypergraphs into monochromatic \(\ell\)-cycles
- Cover \(k\)-uniform hypergraphs by monochromatic loose paths
This page was built for publication: Monochromatic loose-cycle partitions in hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q405239)
