The probability of nonexistence of a subgraph in a moderately sparse random graph

Dudley Stark, Nick Wormald

We develop a general procedure that finds recursions for statistics counting isomorphic copies of a graph $G_0$ in the common random graph models $\mathcal{G}(n,m)$ and ${\cal G}(n,p)…