Loose Hamiltonian Cycles Forced by Large $(k-2)$-Degree---Approximate Version
From MaRDI portal
Publication:5371029
DOI10.1137/16M1065732zbMath1372.05152arXiv1603.04180MaRDI QIDQ5371029
Mathias Schacht, Josefran de Oliveira Bastos, F. Schulenburg, Guilherme Oliveira Mota, Jakob Schnitzer
Publication date: 24 October 2017
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1603.04180
Related Items (12)
Hamiltonicity in cherry-quasirandom 3-graphs ⋮ Hamilton \(\ell\)-cycles in randomly perturbed hypergraphs ⋮ Covering 3‐uniform hypergraphs by vertex‐disjoint tight paths ⋮ On powers of tight Hamilton cycles in randomly perturbed hypergraphs ⋮ Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs ⋮ Loose Hamiltonian cycles forced by large \((k-2)\)-degree -- sharp version ⋮ A general approach to transversal versions of Dirac‐type theorems ⋮ Hamilton cycles in hypergraphs below the Dirac threshold ⋮ Powers of tight Hamilton cycles in randomly perturbed hypergraphs ⋮ Minimum degree thresholds for Hamilton \((k/2)\)-cycles in \(k\)-uniform hypergraphs ⋮ Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs ⋮ Hamiltonicity in randomly perturbed hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Loose Hamiltonian cycles forced by \((k-2)\)-degree -- approximate version
- 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
- Hamilton \(\ell \)-cycles in uniform hypergraphs
- The uniformity lemma for hypergraphs
- Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs
- Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
- Recent advances on Dirac-type problems for hypergraphs
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- Regularity lemmas for hypergraphs and quasi-randomness
- Hamiltonian chains in hypergraphs
This page was built for publication: Loose Hamiltonian Cycles Forced by Large $(k-2)$-Degree---Approximate Version
