Hamilton cycles in random graphs with a fixed degree sequence

DOI10.1137/080741379MaRDI QIDQ5392910zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Colin Cooper, Michael Krivelevich, Alan Frieze

Publication date 15 April 2011

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/080741379

zbMATH Keywords

fixed degree sequenceHamilton cyclesrandom graphs

Mathematics Subject Classification ID

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

Recommendations

• On the number of hamilton cycles in a random graph
• Random graph's Hamiltonicity is strongly tied to its minimum degree
• How many random edges make a dense graph hamiltonian?
• Hamilton cycles containing randomly selected edges in random regular graphs
• scientific article; zbMATH DE number 3922707

Cited in

(14)

• Limit distribution for the existence of Hamiltonian cycles in a random graph
• Hamilton cycles in the semi-random graph process
• Recent advances on the Hamiltonian problem: survey III
• Approximate counting of regular hypergraphs
• Hamilton cycles containing randomly selected edges in random regular graphs
• On the number of hamilton cycles in a random graph
• The threshold for hamilton cycles in the square of a random graph
• scientific article; zbMATH DE number 1047719 (Why is no real title available?)
• scientific article; zbMATH DE number 1496581 (Why is no real title available?)
• Hamilton cycles in the union of random permutations
• Generating and Counting Hamilton Cycles in Random Regular Graphs
• Resilient degree sequences with respect to Hamilton cycles and matchings in random graphs
• Hamilton cycles in random lifts of graphs
• On two Hamilton cycle problems in random graphs

This page was built for publication: Hamilton cycles in random graphs with a fixed degree sequence

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