Abstract#R##N##R##N#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∞.
['A. D. Barbour', 'Svante Janson', 'Michał Karoński', 'Andrzej Ruciński']
Small cliques in random graphs