Tight Hamilton cycles in random uniform hypergraphs

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 Per...

Full description

Saved in:
Bibliographic Details
Published in:Random structures & algorithms 2013-05, Vol.42 (3), p.374-385
Main Authors: Dudek, Andrzej, Frieze, Alan
Format: Article
Language:English
Subjects:
Algorithms
Asymptotic properties
Graphs
Hamiltonicity
random hypergraphs
Reproduction
Thresholds
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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
ISSN:1042-9832
1098-2418
DOI:10.1002/rsa.20404