|
|||||
|
|
Small cliques in random graphs |
|
| Authors: | A. D. Barbour,Svante Janson,Michal Karo&#x ski,Andrzej Ruci&#x ski |
| Affiliation: | A. D. Barbour,Svante Janson,Michal Karoński,Andrzej Ruciński |
| Abstract: | For d ≥ 1, a d-clique in a graph G is a complete d-vertex subgraph not contained in any larger complete subgraph of G. We investigate the limit distribution of the number of d-cliques in the binomial random graph G(n, p), p = p(n), n→∞. |
| Keywords: | |