Author:
Grimmett G. R.,McDiarmid C. J. H.
Abstract
AbstractLet ω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,
Publisher
Cambridge University Press (CUP)
Reference9 articles.
1. On the evolution of random graphs;Erdös;Publ. Math. Inst. Hung. Acad. Sci.,1960
2. On the complete subgraphs of a random graph;Matula;Proc. 2nd. Conf. Comb. Th. and Appl.,1970
3. GRAPH THEORY
4. Majorants of the chromatic number of a random graph;Holgate;J. Roy. Statist. Soc. Ser. B,1969
5. GRAPH COLORING ALGORITHMS††This research was supported in part by the Advanced Research Projects Agency of the Department of Defense under contract SD-302 and by the National Science Foundation under contract GJ-446.
Cited by
227 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献