The Choice Number of Dense Random Graphs

DOI10.1017/S0963548399004101zbMath0944.05047OpenAlexW1990288762WikidataQ128252823 ScholiaQ128252823MaRDI QIDQ4948043

Michael Krivelevich

Publication date: 26 April 2000

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548399004101

zbMATH Keywords

colouringchromatic numberrandom graphchoice numberedge probability

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15)

Related Items (4)

Concentration of non‐Lipschitz functions and applications ⋮ On-line list colouring of random graphs ⋮ Random regular graphs of high degree ⋮ Choosability in random hypergraphs

This page was built for publication: The Choice Number of Dense Random Graphs