Skip to main content Accessibility help

On colouring random graphs

  • G. R. Grimmett (a1) and C. J. H. McDiarmid (a1)


Let ωn denote a random graph with vertex set {1, 2, …, n}, such that each edge is present with a prescribed probability p, independently of the presence or absence of any other edges. We show that the number of vertices in the largest complete subgraph of ωn is, with probability one,



Hide All
(1)Erdös, P. and Rényi, A.On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci. 5A (1960), 1761.
(2)Harary, F.Graph theory (1969) Addison–Wesley.
(3)Holgate, P.Majorants of the chromatic number of a random graph. J. Roy. Statist. Soc. Ser. B 31 (1969), 303309.
(4)Matula, D. W.On the complete subgraphs of a random graph. Proc. 2nd. Conf. Comb. Th. and Appl. (1970) Chapel Hill, 356369.
(5)Matula, D. W., Marble, G. and Isaacson, J. D. Graph colouring algorithms, in Graph theory and computing (1972) Academic Press, London, 109122.
(6)Welsh, D. J. A. and Powell, M. B.An upper bound for the chromatic number of a graph and its application to timetabling problems. Comput. J. 10 (1967), 8586.
(7)Wilf, H. S.The eigenvalues of a graph and its chromatic number. J. London Math. Soc. 42 (1967), 330332.
(8)Wilson, R. J.Introduction to graph theory (1972) Oliver and Boyd, Edinburgh.
(9)Grimmett, G. R.Random Graph Theorems. Proc. 7th Prague Conf. on Information Theory and related topics (1974), in press.

On colouring random graphs

  • G. R. Grimmett (a1) and C. J. H. McDiarmid (a1)


Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed