Loose Hamiltonian cycles forced by (k-2)-degree -- approximate version
From MaRDI portal
Publication:510620
DOI10.1016/J.ENDM.2016.09.056zbMATH Open1356.05098OpenAlexW2613666247MaRDI QIDQ510620FDOQ510620
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
Recommendations
- Loose Hamiltonian cycles forced by large \((k-2)\)-degree-approximate version
- Loose Hamiltonian cycles forced by large \((k-2)\)-degree -- sharp version
- Loose Hamiltonian cycles forced by large \((k-2)\)-degree -- sharp version
- Loose Hamilton cycles in hypergraphs
- Hamilton \(\ell \)-cycles in uniform hypergraphs
Cites Work
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- Title not available (Why is that?)
- Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
- Hamiltonian chains 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 Hamilton cycles in hypergraphs
- Loose Hamiltonian cycles forced by large \((k-2)\)-degree -- sharp version
- Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs
- Loose Hamiltonian cycles forced by \((k-2)\)-degree -- approximate version
Cited In (4)
- Loose Hamiltonian cycles forced by large \((k-2)\)-degree -- sharp version
- The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph
- Loose Hamiltonian Cycles Forced by Large $(k-2)$-Degree---Approximate Version
- Loose Hamiltonian cycles forced by \((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)
