On colouring random graphs

G. R. Grimmett, C. J. H. McDiarmid

Source record

Source: Crossref

Published: Mar 1, 1975

DOI: 10.1017/s0305004100051124

Open original source ↗

Source abstract

Abstract 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,

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.