TY - JOUR
T1 - Random regular graphs of high degree
AU - Krivelevich, Michael
AU - Sudakov, Benny
AU - Vu, Van H.
AU - Wormald, Nicholas C.
PY - 2001/7
Y1 - 2001/7
N2 - Random d-regular graphs have been well studied when d is fixed and the number of vertices goes to infinity. We obtain results on many of the properties of a random d-regular graph when d = d(n) grows more quickly than √n. These properties include connectivity, hamiltonicity, independent set size, chromatic number, choice number, and the size of the second eigenvalue, among others.
AB - Random d-regular graphs have been well studied when d is fixed and the number of vertices goes to infinity. We obtain results on many of the properties of a random d-regular graph when d = d(n) grows more quickly than √n. These properties include connectivity, hamiltonicity, independent set size, chromatic number, choice number, and the size of the second eigenvalue, among others.
UR - http://www.scopus.com/inward/record.url?scp=0035609582&partnerID=8YFLogxK
U2 - 10.1002/rsa.1013
DO - 10.1002/rsa.1013
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0035609582
SN - 1042-9832
VL - 18
SP - 346
EP - 363
JO - Random Structures and Algorithms
JF - Random Structures and Algorithms
IS - 4
ER -