Induced subgraphs in sparse random graphs with given degree sequence

Pu Gao, Yi Su, Nicholas Wormald

For any $S\subset [n]$, we compute the probability that the subgraph of ${\mathcal{G}}_{n,d}$ induced by $S$ is a given graph $H$ on the vertex set $S$. The result holds for any $d=o…