McDiarmid, Colin Achromatic numbers of random graphs. (English) Zbl 0489.05055 Math. Proc. Camb. Philos. Soc. 92, 21-28 (1982). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 5 Documents MSC: 05C99 Graph theory 60C05 Combinatorial probability Keywords:labelled graphs; achromatic number; contraction clique number; chromatic number; random graph PDFBibTeX XMLCite \textit{C. McDiarmid}, Math. Proc. Camb. Philos. Soc. 92, 21--28 (1982; Zbl 0489.05055) Full Text: DOI References: [1] Erd?;s, Probabilistic methods in combinatorics (1974) [2] Bollobas, Europ. J. Combinatorics 1 pp 195– (1980) · Zbl 0457.05041 · doi:10.1016/S0195-6698(80)80001-1 [3] Bollob?s, Graph theory - an introductory course 63 (1979) [4] Bollob?s, Math. Proc. Cambridge Phil. Soc 80 pp 419– (1976) [5] Smythe, Lecture Notes in Mathematics 671 (1978) [6] McDiarmid, Graph Theory and Combinatorics 34 pp 76– (1977) [7] DOI: 10.1007/BF01651330 · Zbl 0346.06011 · doi:10.1007/BF01651330 [8] Johnson, Graph Theory and Computing, Proc. Fifth S.E. Conf. on Combinatorics pp 513– (1974) [9] McDiarmid, Technical Report (1976) [10] Harris, Proc. Cambridge Phil. Soc 56 pp 13– (1960) [11] Grimmett, Math. Proc. Cambridge Phil. Soc 77 pp 313– (1975) [12] Garey, Computers and intractability (1979) [13] DOI: 10.1137/0208001 · Zbl 0401.05043 · doi:10.1137/0208001 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.