Generalized chromatic numbers of random graphs

DOI10.1002/rsa.3240060222zbMath0862.05093OpenAlexW1987487523MaRDI QIDQ4697825

Béla Bollobás, Andrew G. Thomason

Publication date: 1 May 1995

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

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

zbMATH Keywords

chromatic numberisomorphismrandom graphhereditary graph

Mathematics Subject Classification ID

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

Related Items

The maximum edit distance from hereditary graph properties, Measures on monotone properties of graphs, The speed of hereditary properties of graphs

Cites Work

• Sharp concentration of the chromatic number on random graphs \(G_{n,p}\)
• On the independence and chromatic numbers of random regular graphs
• Generalized Chromatic Numbers of Random Graphs
• Uniquely Colourable Graphs with Large Girth
• The chromatic number of random graphs
• The chromatic number of random graphs