Name
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 ⩽ r ⩽ c0n for some small constant c0. We prove that, with probability tending to 1 as n → ∞, Gr is r-connected and Hamiltonian. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1017/S0963548301005090 | Combinatorics, Probability & Computing |
Keywords | Field | DocType |
gr denote,small constant c0,vertex set,r-regular graph,non-constant degree,random regular graphs | Random regular graph,Discrete mathematics,Combinatorics,Strongly regular graph,Indifference graph,Random graph,Vertex (geometry),Hamiltonian (quantum mechanics),Chordal graph,Mathematics,Maximal independent set | Journal |
Volume | Issue | ISSN |
11 | 3 | 0963-5483 |
Citations | PageRank | References |
13 | 0.94 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Colin Cooper | 1 | 287 | 30.73 |
| Alan M. Frieze | 2 | 4837 | 787.00 |
| Bruce Reed | 3 | 13 | 0.94 |