Random Regular Graphs of Non-Constant Degree: Connectivity and Hamiltonicity
From MaRDI portal
Publication:3147237
DOI10.1017/S0963548301005090zbMath1005.05039WikidataQ57401527 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)
05C80: Random graphs (graph-theoretic aspects)
05C40: Connectivity
05C45: Eulerian and Hamiltonian graphs
Related Items
Perfect matchings and Hamiltonian cycles in the preferential attachment model, Edge Correlations in Random Regular Hypergraphs and Applications to Subgraph Testing, Loose Hamilton Cycles in Regular Hypergraphs, Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity, The cook-book approach to the differential equation method, Sandwiching random graphs: universality between random graph models, Random Latin square graphs