Loose Hamiltonian cycles forced by \((k-2)\)-degree -- approximate version

DOI10.1016/J.ENDM.2016.09.056zbMath1356.05098OpenAlexW2613666247MaRDI QIDQ510620

J. de O. Bastos, Mathias Schacht, F. Schulenburg, Jakob Schnitzer, Guilherme Oliveira Mota

Publication date: 13 February 2017

Full work available at URL: https://doi.org/10.1016/j.endm.2016.09.056

zbMATH Keywords

hypergraphsHamiltonian cyclesdegree conditions

Mathematics Subject Classification ID

Hypergraphs (05C65) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)

Related Items (4)

The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph ⋮ Loose Hamiltonian cycles forced by large \((k-2)\)-degree -- sharp version ⋮ Loose Hamiltonian Cycles Forced by Large $(k-2)$-Degree---Approximate Version ⋮ Loose Hamiltonian cycles forced by \((k-2)\)-degree -- approximate version

Cites Work

• 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
• 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
• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• Hamiltonian chains in hypergraphs

This page was built for publication: Loose Hamiltonian cycles forced by \((k-2)\)-degree -- approximate version