On Hamiltonian cycles in hypergraphs with dense link graphs
From MaRDI portal
Publication:2040014
DOI10.1016/J.JCTB.2021.04.001zbMath1473.05155arXiv2007.03820OpenAlexW3154806716MaRDI QIDQ2040014
Joanna Polcyn, Bjarne Schülke, Christian Reiher, Vojtěch Rödl
Publication date: 6 July 2021
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.03820
Related Items (5)
Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs ⋮ Minimum degree conditions for tight Hamilton cycles ⋮ Dirac-type conditions for spanning bounded-degree hypertrees ⋮ Minimum pair degree condition for tight Hamiltonian cycles in 4-uniform hypergraphs ⋮ Decomposing hypergraphs into cycle factors
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A degree sequence Hajnal-Szemerédi theorem
- Forbidding Hamilton cycles in uniform hypergraphs
- Supersaturated graphs and hypergraphs
- An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
- Non-averaging subsets and non-vanishing transversals
- Rational exponents for hypergraph Turan problems
- Minimum pair degree condition for tight Hamiltonian cycles in 4-uniform hypergraphs
- A correlation inequality for bipartite graphs
- On extremal problems of graphs and generalized graphs
- On Hamilton's ideals
- On Degree Sequences Forcing The Square of a Hamilton Cycle
- Hamiltonian chains in hypergraphs
- Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs
- A Holder Type Inequality for Symmetric Matrices with Nonnegative Entries
- Some Theorems on Abstract Graphs
- On some graph densities in locally dense graphs
- Minimum degree conditions for tight Hamilton cycles
This page was built for publication: On Hamiltonian cycles in hypergraphs with dense link graphs
