On the chromatic number of random graphs

DOI10.1002/rsa.3240010404zbMath0744.05047OpenAlexW2069226351MaRDI QIDQ5966556

Colin J. H. McDiarmid

Publication date: 25 June 1992

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.3240010404

zbMATH Keywords

random graphschromatic number

Mathematics Subject Classification ID

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

Related Items (8)

The set chromatic number of random graphs ⋮ Two-point concentration in random geometric graphs ⋮ On Two Limit Values of the Chromatic Number of a Random Hypergraph ⋮ On the chromatic number in the stochastic block model ⋮ On-line list colouring of random graphs ⋮ Excluding induced subgraphs. II: Extremal graphs ⋮ Sharp concentration of the equitable chromatic number of dense random graphs ⋮ Graph imperfection. II

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: On the chromatic number of random graphs