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

DOI10.1016/J.ENDM.2016.09.056MaRDI QIDQ510620zbMATH OpenOpenAlexFDO

Authors J. de O. Bastos, M. Schacht, F. Schulenburg, G. O. Mota, Jakob Schnitzer

Publication date 13 February 2017

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

zbMATH Keywords

Hamiltonian cycleshypergraphsdegree conditions

Mathematics Subject Classification ID

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

Recommendations

• Loose Hamiltonian cycles forced by large (k-2)-degree-approximate version
• Loose Hamilton cycles in hypergraphs
• Hamilton \(\ell \)-cycles in uniform hypergraphs

Cites work

• scientific article; zbMATH DE number 3641497 (Why is no real title available?)
• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• 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
• Hamiltonian chains in hypergraphs
• Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
• Loose Hamilton cycles in hypergraphs
• Loose Hamiltonian cycles forced by \((k-2)\)-degree -- approximate version
• Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs
• Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs

Cited in

(3)

• The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph
• Loose Hamiltonian cycles forced by \((k-2)\)-degree -- approximate version
• Loose Hamiltonian cycles forced by large (k-2)-degree-approximate version

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q510620)