Author:
COOPER COLIN,FRIEZE ALAN,REED BRUCE
Abstract
Let Gr denote a graph chosen uniformly at random from the set of r-regular graphs with
vertex set
{1,2, …, n}, where 3 [les ] r [les ] c0n for some small constant c0. We prove that, with
probability tending to 1 as n
→ ∞, Gr is r-connected and Hamiltonian.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Cited by
25 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献