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

Josefran de Oliveira Bastos, Guilherme Oliveira Mota, Mathias Schacht, Jakob Schnitzer, Fabian Schulenburg


We prove for all k\geq 4 and 1\leq \ell <k/2 the sharp minimum (k-2)-degree bound for a k-uniform hypergraph H on n vertices to contain a Hamiltonian \ell-cycle if k-\ell divides n and n is sufficiently large. This extends a result of Han and Zhao for 3-uniform hypegraphs.


Hypergraphs; Hamiltonian cycles; Degree conditions

Full Text:


DOI: https://doi.org/10.11575/cdm.v13i2.62730

DOI (PDF): https://doi.org/10.11575/cdm.v13i2.62730.g46827


  • There are currently no refbacks.

Contributions to Discrete Mathematics. ISSN: 1715-0868