@article{e3d7bc0f89ee49d4a6b3fb860769f489,
title = "Minimum codegree threshold for Hamilton ℓ-cycles in k-uniform hypergraphs",
abstract = "For 1. ≤. ℓ. <. k/2, we show that for sufficiently large n, every k-uniform hypergraph on n vertices with minimum codegree at least n2(k-ℓ) contains a Hamilton ℓ-cycle. This codegree condition is best possible and improves on work of H{\`a}n and Schacht who proved an asymptotic result.",
keywords = "Absorbing method, Hamilton cycle, Hypergraph, Regularity lemma",
author = "Jie Han and Yi Zhao",
note = "Publisher Copyright: {\textcopyright} 2015.",
year = "2015",
month = may,
day = "1",
doi = "10.1016/j.jcta.2015.01.004",
language = "English",
volume = "132",
pages = "194--223",
journal = "Journal of Combinatorial Theory. Series A",
issn = "0097-3165",
publisher = "Academic Press Inc.",
}