Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-17T17:31:52.888Z Has data issue: false hasContentIssue false

On colouring random graphs

Published online by Cambridge University Press:  24 October 2008

G. R. Grimmett
Affiliation:
Mathematical Institute, Oxford
C. J. H. McDiarmid
Affiliation:
Mathematical Institute, Oxford
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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,

Information

Type
Research Article
Copyright
Copyright © Cambridge Philosophical Society 1975