On the number of hamilton cycles in a random graph

DOI10.1002/jgt.3190130608zbMath0707.05053OpenAlexW2066182228WikidataQ57401608 ScholiaQ57401608MaRDI QIDQ3487391

Colin Cooper, Alan M. Frieze

Publication date: 1989

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190130608

zbMATH Keywords

random graphsHamiltonian cyclesgraph evolution

Mathematics Subject Classification ID

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

Related Items (5)

The maximum number of Hamiltonian cycles in graphs with a fixed number of vertices and edges ⋮ Powers of Hamilton cycles in pseudorandom graphs ⋮ Lower bound on the number of Hamiltonian cycles of generalized Petersen graphs ⋮ Increasing Hamiltonian paths in random edge orderings ⋮ Random directed graphs are robustly Hamiltonian

Cites Work

• Limit distribution for the existence of Hamiltonian cycles in random bipartite graphs

This page was built for publication: On the number of hamilton cycles in a random graph