Loose Hamiltonian cycles forced by large \((k-2)\)-degree -- sharp version
From MaRDI portal
Publication:1689892
DOI10.1016/j.endm.2017.06.026zbMath1378.05151arXiv1705.03707MaRDI QIDQ1689892
Mathias Schacht, J. de O. Bastos, F. Schulenburg, Jakob Schnitzer, Guilherme Oliveira Mota, Josefran de Oliveira Bastos
Publication date: 18 January 2018
Full work available at URL: https://arxiv.org/abs/1705.03707
Related Items
Powers of tight Hamilton cycles in randomly perturbed hypergraphs, Loose Hamiltonian cycles forced by \((k-2)\)-degree -- approximate version, Loose Hamiltonian cycles forced by large \((k-2)\)-degree -- sharp version, Hamilton cycles in hypergraphs below the Dirac threshold
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
- Forbidding just one intersection
- Loose Hamiltonian cycles forced by large \((k-2)\)-degree -- sharp version
- 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
- Loose Hamiltonian Cycles Forced by Large $(k-2)$-Degree---Approximate Version
