Tight Hamilton cycles in random uniform hypergraphs. Issue 3 (5th February 2012)

• Record Type: Journal Article
• Authors: Dudek, Andrzej; Frieze, Alan
• Is Part Of: Random structures & algorithms. Volume 42:Issue 3(2013)
• Page Start: 374
• Page End: 385
• Publication Date: 2012-02-05
• Subjects: Random graphs -- Periodicals; Mathematical analysis -- Periodicals; 519
• DOI: 10.1002/rsa.20404
• Languages: English
• ISSNs: 1042-9832

Abstract

<abstract abstract-type="main" xml:lang="en"> <title>Abstract</title> <p>In this paper we show that <italic>e</italic>/<italic>n</italic> is the sharp threshold for the existence of tight Hamilton cycles in random <italic>k</italic> ‐uniform hypergraphs, for all <italic>k</italic> ≥ 4. When <italic>k</italic> = 3 we show that 1/<italic>n</italic> 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</p> </abstract>