TY - JOUR

T1 - The Choice Number of Dense Random Graphs

AU - Krivelevich, Michael

PY - 2000

Y1 - 2000

N2 - We prove that if the edge probability p(n) satisfies n-1/4+∈ ≤ p(n) ≤ 3/4, where 0 < ∈ < 1/4 is a constant, then the choice number and the chromatic number of the random graph G(n,p) are almost surely asymptotically equal.

AB - We prove that if the edge probability p(n) satisfies n-1/4+∈ ≤ p(n) ≤ 3/4, where 0 < ∈ < 1/4 is a constant, then the choice number and the chromatic number of the random graph G(n,p) are almost surely asymptotically equal.

UR - http://www.scopus.com/inward/record.url?scp=0034380792&partnerID=8YFLogxK

U2 - 10.1017/S0963548399004101

DO - 10.1017/S0963548399004101

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0034380792

SN - 0963-5483

VL - 9

SP - 19

EP - 26

JO - Combinatorics Probability and Computing

JF - Combinatorics Probability and Computing

IS - 1

ER -