Premium
Tight Hamilton cycles in random uniform hypergraphs
Author(s) -
Dudek Andrzej,
Frieze Alan
Publication year - 2013
Publication title -
random structures and algorithms
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.314
H-Index - 69
eISSN - 1098-2418
pISSN - 1042-9832
DOI - 10.1002/rsa.20404
Subject(s) - mathematics , struct , combinatorics , random graph , discrete mathematics , statistical physics , physics , computer science , graph , programming language
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. © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 2013