The Choice Number of Dense Random Graphs

Michael Krivelevich

doi:10.1017/S0963548399004101

The Choice Number of Dense Random Graphs

Michael Krivelevich^*

^*Corresponding author for this work

School of Mathematical Sciences

Institute for Advanced Studies

Research output: Contribution to journal › Article › peer-review

9 Scopus citations

Abstract

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.

Original language	English
Pages (from-to)	19-26
Number of pages	8
Journal	Combinatorics Probability and Computing
Volume	9
Issue number	1
DOIs	https://doi.org/10.1017/S0963548399004101
State	Published - 2000

Access to Document

10.1017/S0963548399004101

Cite this

@article{8b5cecc879b945f69399713315837278,

title = "The Choice Number of Dense Random Graphs",

abstract = "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.",

author = "Michael Krivelevich",

year = "2000",

doi = "10.1017/S0963548399004101",

language = "אנגלית",

volume = "9",

pages = "19--26",

journal = "Combinatorics Probability and Computing",

issn = "0963-5483",

publisher = "Cambridge University Press",

number = "1",

}

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 - https://www.scopus.com/pages/publications/0034380792

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 -

The Choice Number of Dense Random Graphs

Abstract

Access to Document

Other files and links

Fingerprint

Cite this