Tight Hamilton cycles in random uniform hypergraphs

DOI10.1002/RSA.20404MaRDI QIDQ4921888zbMATH OpenOpenAlexWikidataFDO

Authors Andrzej Dudek, Alan Frieze

Publication date 28 May 2013

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1101.2424

zbMATH Keywords

hamiltonicityrandom hypergraphs

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Hypergraphs (05C65) Random graphs (graph-theoretic aspects) (05C80)

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 $kge4$. 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.

Recommendations

• Tight Hamilton cycles in random hypergraphs
• Loose Hamilton cycles in random uniform hypergraphs
• On rainbow Hamilton cycles in random hypergraphs
• Finding tight Hamilton cycles in random hypergraphs faster
• Packing tight Hamilton cycles in 3-uniform hypergraphs

Cites work

• Cycles in random graphs
• General percolation and random graphs
• Hamiltonian circuits in random graphs
• scientific article; zbMATH DE number 3922707 (Why is no real title available?)
• Limit distribution for the existence of Hamiltonian cycles in a random graph
• Loose Hamilton cycles in random 3-uniform hypergraphs
• Loose Hamilton cycles in random uniform hypergraphs

Cited in

(38)

• Hamilton -cycles in randomly perturbed hypergraphs
• On rainbow Hamilton cycles in random hypergraphs
• On offset Hamilton cycles in random hypergraphs
• Hamilton cycles in hypergraphs below the Dirac threshold
• Hamilton saturated hypergraphs of essentially minimum size
• A threshold result for loose Hamiltonicity in random regular uniform hypergraphs
• Finding tight Hamilton cycles in random hypergraphs faster
• Recent advances on the Hamiltonian problem: survey III
• Packing tight Hamilton cycles in 3-uniform hypergraphs
• Packing Hamilton cycles in random and pseudo-random hypergraphs
• Spanning structures and universality in sparse hypergraphs
• Cycles and matchings in randomly perturbed digraphs and hypergraphs
• On spanning structures in random hypergraphs
• Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity
• Monochromatic Hamiltoniant-tight Berge-cycles in hypergraphs
• Law of the iterated logarithm for random graphs
• Powers of Hamilton cycles in random graphs and tight Hamilton cycles in random hypergraphs
• Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs
• Hamiltonian Berge cycles in random hypergraphs
• Finding tight Hamilton cycles in random hypergraphs faster
• A Dirac-type theorem for Hamilton Berge cycles in random hypergraphs
• Sharp thresholds for nonlinear Hamiltonian cycles in hypergraphs
• Longest paths in random hypergraphs
• Powers of tight Hamilton cycles in randomly perturbed hypergraphs
• A sharp threshold for spanning 2-spheres in random 2-complexes
• Edge correlations in Random regular hypergraphs and applications to subgraph testing
• Tight Hamilton cycles in random hypergraphs
• Loose Hamilton Cycles in Regular Hypergraphs
• Packing tight Hamilton cycles in 3-uniform hypergraphs
• Counting Hamilton cycles in Dirac hypergraphs
• On powers of tight Hamilton cycles in randomly perturbed hypergraphs
• What Are Higher-Order Networks?
• Hamilton cycles in the line graph of a random hypergraph
• Resilience for tight Hamiltonicity
• Optimal spread for spanning subgraphs of Dirac hypergraphs
• Paths, cycles and sprinkling in random hypergraphs
• The threshold for powers of tight Hamilton cycles in random hypergraphs
• Hamiltonicity in randomly perturbed hypergraphs

This page was built for publication: Tight Hamilton cycles in random uniform hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4921888)