Key points are not available for this paper at this time.
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,
Grimmett et al. (Sat,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: