Date of Original Version
This is the accepted version of the article which has been published in final form at http://dx.doi.org/10.1002/rsa.20404
Abstract or Description
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 ≥ 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.
Random Structures and Algorithms, 42, 3, 374-385.