Skip to main content Accessibility help
×
Home

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

  • COLIN COOPER (a1), ALAN FRIEZE (a2) and BRUCE REED (a3)

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.

Copyright

Related content

Powered by UNSILO

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

  • COLIN COOPER (a1), ALAN FRIEZE (a2) and BRUCE REED (a3)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.