On a method for random graphs


In the literature the following method is often used when investigating subgraphs of a given type in a random graPh. Suppose one wants to prove that a random graph contains almost surely (a.s.) a subgraph S possessing two given properties, say A and B. Then, in the first step, one shows that a random graph contains a.s. at least one subgraph having the… (More)
DOI: 10.1016/0012-365X(86)90096-8