On the threshold for k-regular subgraphs of random graphs

Pawel Pralat, Jacques Verstraete, Nicholas Wormald

The $k$-core of a graph is the largest subgraph of minimum degree at least $k$. We show that for $k$ sufficiently large, the $(k+2)$-core of a random graph $\G(n,p)$ asymptotical…