Achromatic numbers of random graphs

DOI10.1017/S0305004100059648zbMath0489.05055OpenAlexW2123425620MaRDI QIDQ3950590

Colin J. H. McDiarmid

Publication date: 1982

Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

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

zbMATH Keywords

chromatic numberachromatic numberrandom graphlabelled graphscontraction clique number

Mathematics Subject Classification ID

Combinatorial probability (60C05) Graph theory (05C99)

Related Items (5)

Bounds for the \(b\)-chromatic number of \(G-v\) ⋮ Complete partitions of graphs ⋮ \(b\)-chromatic number of Cartesian product of some families of graphs ⋮ On the chromatic forcing number of a random graph ⋮ Lattice bandwidth of random graphs

Cites Work

• Hadwiger's conjecture is true for almost every graph
• Correlation inequalities on some partially ordered sets
• Determining the Chromatic Number of a Graph

This page was built for publication: Achromatic numbers of random graphs