Hamilton cycles in quasirandom hypergraphs
From MaRDI portal
Publication:2820275
DOI10.1002/rsa.20638zbMath1346.05153arXiv1502.04041MaRDI QIDQ2820275
John Lenz, Richard Mycroft, Dhruv Mubayi
Publication date: 15 September 2016
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1502.04041
05C80: Random graphs (graph-theoretic aspects)
05C65: Hypergraphs
05C45: Eulerian and Hamiltonian graphs
Related Items
Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs, Localized Codegree Conditions for Tight Hamilton Cycles in 3-Uniform Hypergraphs, Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs, Hamilton \(\ell \)-cycles in uniform hypergraphs, Hamiltonicity in cherry-quasirandom 3-graphs
Cites Work
- Perfect packings in quasirandom hypergraphs. I.
- Hamilton cycles in highly connected and expanding graphs
- Loose Hamilton cycles in hypergraphs
- Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
- An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
- Dirac-type results for loose Hamilton cycles in uniform hypergraphs
- Hamiltonian degree sequences in digraphs
- Hamilton \(\ell \)-cycles in uniform hypergraphs
- Hamilton cycles in sparse robustly expanding digraphs
- Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs
- Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
- Packing tight Hamilton cycles in 3-uniform hypergraphs
- Packing hamilton cycles in random and pseudo-random hypergraphs
- Packing Tight Hamilton Cycles in Uniform Hypergraphs
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- Hamiltonian chains in hypergraphs
- The poset of hypergraph quasirandomness
- EIGENVALUES AND LINEAR QUASIRANDOM HYPERGRAPHS
- Some Theorems on Abstract Graphs
- Quasi-random graphs
