Decomposing hypergraphs into cycle factors
From MaRDI portal
Publication:2101168
DOI10.1016/j.jctb.2022.09.004OpenAlexW3156400414MaRDI QIDQ2101168
Marcus Kühn, Felix Joos, Bjarne Schülke
Publication date: 28 November 2022
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.06333
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- Unnamed Item
- Counting and packing Hamilton cycles in dense graphs and oriented graphs
- Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs
- Asymptotic behavior of the chromatic index for hypergraphs
- An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
- On a packing and covering problem
- On tail probabilities for martingales
- Resolution of the Oberwolfach problem
- On Hamiltonian cycles in hypergraphs with dense link graphs
- A proof of Ringel's conjecture
- Packing hamilton cycles in random and pseudo-random hypergraphs
- Packing Tight Hamilton Cycles in Uniform Hypergraphs
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- Optimal Packings of Hamilton Cycles in Graphs of High Minimum Degree
- A bandwidth theorem for approximate decompositions
- Pseudorandom hypergraph matchings
- Extremal aspects of graph and hypergraph decomposition problems
- Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs
- Proof of the 1-factorization and Hamilton Decomposition Conjectures
- Counting and packing Hamilton \(\ell\)-cycles in dense hypergraphs
- Fractional cycle decompositions in hypergraphs
- Minimum degree conditions for tight Hamilton cycles
This page was built for publication: Decomposing hypergraphs into cycle factors
