Hamilton cycles containing randomly selected edges in random regular graphs

DOI10.1002/rsa.1024zbMath0980.05036OpenAlexW2062587363MaRDI QIDQ2748422

Robert W. Robinson, Nicholas C. Wormald

Publication date: 25 February 2002

Published in: Random Structures and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.1024

zbMATH Keywords

Hamilton cyclesrandom regular graph

Mathematics Subject Classification ID

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

Related Items

Elegantly Colored Paths and Cycles in Edge Colored Random Graphs, Cycle lengths in sparse random graphs, The asymptotic number of claw-free cubic graphs.

Cites Work

• Unnamed Item
• Automorphisms of random graphs with specified vertices
• The number of matchings in random regular graphs and bipartite graphs
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• The asymptotic number of labeled graphs with given degree sequences
• Almost all cubic graphs are Hamiltonian
• Almost all regular graphs are hamiltonian
• The Asymptotic Number of Unlabelled Regular Graphs
• Random Regular Graphs: Asymptotic Distributions and Contiguity
• Generating and Counting Hamilton Cycles in Random Regular Graphs