Loose Hamilton cycles in hypergraphs
Combinatorics
2015-09-15 v2
Abstract
We prove that any k-uniform hypergraph on n vertices with minimum degree at least n/(2(k-1))+o(n) contains a loose Hamilton cycle. The proof strategy is similar to that used by K\"uhn and Osthus for the 3-uniform case. Though some additional difficulties arise in the k-uniform case, our argument here is considerably simplified by applying the recent hypergraph blow-up lemma of Keevash.
Keywords
Cite
@article{arxiv.0808.1713,
title = {Loose Hamilton cycles in hypergraphs},
author = {Peter Keevash and Daniela Kühn and Richard Mycroft and Deryk Osthus},
journal= {arXiv preprint arXiv:0808.1713},
year = {2015}
}
Comments
new version which contains minor revisions and updates