Tight Hamilton Cycles in Random Uniform Hypergraphs

Andrzej Dudek; Alan Frieze

Tight Hamilton Cycles in Random Uniform Hypergraphs

Combinatorics 2011-07-27 v4

Authors: Andrzej Dudek , Alan Frieze

Abstract

In this paper we show that $e/n$ is the sharp threshold for the existence of tight Hamilton cycles in random $k$ -uniform hypergraphs, for all $k\ge 4$ . When $k=3$ we show that $1/n$ is an asymptotic threshold. We also determine thresholds for the existence of other types of Hamilton cycles.

Keywords

hamilton cycles hypergraph theory graph cycles

Cite

@article{arxiv.1101.2424,
  title  = {Tight Hamilton Cycles in Random Uniform Hypergraphs},
  author = {Andrzej Dudek and Alan Frieze},
  journal= {arXiv preprint arXiv:1101.2424},
  year   = {2011}
}

Comments

9 pages. Updated to add material

Related papers

View all related →