Random Regular Graphs of Non-Constant Degree: Connectivity and Hamiltonicity

DOI10.1017/S0963548301005090zbMATH Open1005.05039OpenAlexW1995083067WikidataQ57401527 ScholiaQ57401527MaRDI QIDQ3147237FDOQ3147237

Authors Colin Cooper, Alan Frieze, Bruce Reed 

Publication date 11 February 2003

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0963548301005090

Mathematics Subject Classification ID

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

Recommendations

• Hamiltonian cycles in random regular graphs
• Random Regular Graphs of Non-Constant Degree: Independence and Chromatic Number
• Random regular graphs of high degree
• Hamilton cycles containing randomly selected edges in random regular graphs
• Generating and Counting Hamilton Cycles in Random Regular Graphs

Cited In (21)

• Random Regular Graphs of Non-Constant Degree: Independence and Chromatic Number
• Perfect matchings and Hamiltonian cycles in the preferential attachment model
• Dirac's theorem for random regular graphs
• Random Latin square graphs
• Almost all regular graphs are hamiltonian
• Hamiltonicity of randomly perturbed graphs
• Lower bounds for sense of direction in regular graphs
• On \(r\)-regular subgraphs with Hamiltonian cycles in graphs with many edges
• Resilience with respect to Hamiltonicity in random graphs
• The cook-book approach to the differential equation method
• Hamilton cycles in pseudorandom graphs
• Loose Hamilton Cycles in Regular Hypergraphs
• Combinatorics. Abstracts from the workshop held January 1--7, 2023
• Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity
• Hamiltonicity of graphs perturbed by a random regular graph
• Subgraph probability of random graphs with specified degrees and applications to chromatic number and connectivity
• Sandwiching dense random regular graphs between binomial random graphs
• Hamiltonian cycles in random regular graphs
• Sandwiching random graphs: universality between random graph models
• Random regular graphs of high degree
• Edge correlations in Random regular hypergraphs and applications to subgraph testing

This page was built for publication: Random Regular Graphs of Non-Constant Degree: Connectivity and Hamiltonicity

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