The Property of Having a $k$-Regular Subgraph Has a Sharp Threshold

Shoham Letzter

We prove that the property of containing a $k$-regular subgraph in the random graph model $G(n,p)$ has a sharp threshold for $k\ge 3$. We also show how to use similar methods to obt…