Tight Hamilton Cycles in Random Uniform Hypergraphs

2011/01/12 by Dudek, Andrzej, Frieze, Alan · 2 citations
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1101.2424

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

Cited by

• Loose Hamiltonicity
• Perturbation of dense graphs

Related

• Tight Hamilton cycles in random hypergraphs
• The threshold for powers of tight Hamilton cycles in random hypergraphs
• The threshold for loose Hamilton cycles in random hypergraph
• A threshold result for loose Hamiltonicity in random regular uniform hypergraphs
• On powers of tight Hamilton cycles in randomly perturbed hypergraphs