On colouring random graphs 论文
1975Mathematical Proceedings of the Cambridge Philosophical Society引用 349
Limits and Structures in Graph TheoryAdvanced Graph Theory Research
摘要
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,