Minimum codegree threshold for Hamilton l-cycles in k-uniform hypergraphs

Jie Han; Yi Zhao

Minimum codegree threshold for Hamilton l-cycles in k-uniform hypergraphs

Combinatorics 2015-01-29 v2

Authors: Jie Han , Yi Zhao

Abstract

For $1\le \ell<k/2$ , we show that for sufficiently large $n$ , every $k$ -uniform hypergraph on $n$ vertices with minimum codegree at least $\frac n{2 (k-\ell)}$ contains a Hamilton $\ell$ -cycle. This codegree condition is best possible and improves on work of H\`an and Schacht who proved an asymptotic result.

Keywords

hamilton cycles hypergraph theory graph cycles

Cite

@article{arxiv.1406.2225,
  title  = {Minimum codegree threshold for Hamilton l-cycles in k-uniform hypergraphs},
  author = {Jie Han and Yi Zhao},
  journal= {arXiv preprint arXiv:1406.2225},
  year   = {2015}
}

Comments

22 pages, 0 figure. Accepted for publication in JCTA. arXiv admin note: text overlap with arXiv:1307.3693

Related papers

View all related →