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

DOI10.1017/S0963548301005090zbMath1005.05039OpenAlexW1995083067WikidataQ57401527 ScholiaQ57401527MaRDI QIDQ3147237

Colin Cooper, Alan M. Frieze, Bruce A. 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) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items

Sandwiching random graphs: universality between random graph models, Random Latin square graphs, Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity, Combinatorics. Abstracts from the workshop held January 1--7, 2023, Hamiltonicity of graphs perturbed by a random regular graph, Subgraph probability of random graphs with specified degrees and applications to chromatic number and connectivity, Loose Hamilton Cycles in Regular Hypergraphs, The cook-book approach to the differential equation method, Lower bounds for sense of direction in regular graphs, Perfect matchings and Hamiltonian cycles in the preferential attachment model, Edge Correlations in Random Regular Hypergraphs and Applications to Subgraph Testing, Dirac’s theorem for random regular graphs, Sandwiching dense random regular graphs between binomial random graphs