Hamiltonian cycles in random regular graphs

DOI10.1016/0095-8956(84)90066-2MaRDI QIDQ1063002zbMATH OpenOpenAlexDBLPWikidataFDO

Authors T. I. Fenner, Alan Frieze

Publication date 1984

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0095-8956(84)90066-2

zbMATH Keywords

Hamilton cycleregular random graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Almost all regular graphs are hamiltonian
• Generating and Counting Hamilton Cycles in Random Regular Graphs
• Finding Hamilton cycles in sparse random graphs
• Random Regular Graphs of Non-Constant Degree: Connectivity and Hamiltonicity
• Almost all cubic graphs are Hamiltonian

Cites work

• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• scientific article; zbMATH DE number 3482343 (Why is no real title available?)
• scientific article; zbMATH DE number 3549021 (Why is no real title available?)
• General percolation and random graphs
• Hamiltonian circuits in random graphs
• Limit distribution for the existence of Hamiltonian cycles in a random graph
• On the existence of Hamiltonian cycles in a class of random graphs
• The number of matchings in random regular graphs and bipartite graphs

Cited in

(37)

• A note on long cycles in sparse random graphs
• scientific article; zbMATH DE number 3902693 (Why is no real title available?)
• Partitioning random graphs into large cycles
• On the number of hamilton cycles in a random graph
• Hamiltonian cycles on a random three-coordinate lattice
• On two Hamilton cycle problems in random graphs
• Dirac's theorem for random regular graphs
• Random Regular Graphs of Non-Constant Degree: Connectivity and Hamiltonicity
• Hamilton cycles in the semi-random graph process
• scientific article; zbMATH DE number 4152419 (Why is no real title available?)
• Hamilton Cycles in Random Regular Digraphs
• Almost all regular graphs are hamiltonian
• The threshold for hamilton cycles in the square of a random graph
• scientific article; zbMATH DE number 4127257 (Why is no real title available?)
• High powers of Hamiltonian cycles in randomly augmented graphs
• On extension of regular graphs
• Hamilton cycles containing randomly selected edges in random regular graphs
• Random near-regular graphs and the node packing problem
• scientific article; zbMATH DE number 1047719 (Why is no real title available?)
• On the existence of Hamiltonian cycles in a class of random graphs
• A scaling limit for the length of the longest cycle in a sparse random graph
• On the Number of Hamilton Cycles in Sparse Random Graphs
• scientific article; zbMATH DE number 4110727 (Why is no real title available?)
• Hamilton cycles in random lifts of graphs
• On the Hamiltonicity of random bipartite graphs
• Asymptotic enumeration by degree sequence of graphs of high degree
• scientific article; zbMATH DE number 4031730 (Why is no real title available?)
• Rainbow Hamilton cycles in random regular graphs
• scientific article; zbMATH DE number 1496581 (Why is no real title available?)
• Limit distribution for the existence of Hamiltonian cycles in a random graph
• Perfect fractional matchings in \(k\)-out hypergraphs
• Local resilience and hamiltonicity maker-breaker games in random regular graphs
• Sparse pseudo‐random graphs are Hamiltonian
• On the Hamiltonicity of the k-regular graph game
• Generating and Counting Hamilton Cycles in Random Regular Graphs
• Finding Hamilton cycles in sparse random graphs
• Hamilton cycles in the union of random permutations

This page was built for publication: Hamiltonian cycles in random regular graphs

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