the $k$-core of a graph is the largest subgraph of minimum degree at least $k$. in this talk, we will be discussing the appearance of $k$-regular subgraphs of random graphs in the $erdos-r \acute e nyi$ model of random graphs. pittel, spencer and wormald determined very precisely when the $k$-core of a random graph appears. the $k$-core of a graph is revealed by performing a greedy vertex-deletion algorithm, whereas no simple algorithm exists for finding $k$-regular subgraphs when $k > 2$. i will present a combination of algebraic, probabilistic and structural techniques which pin down the point of appearance of a $k$-regular subgraph in a random graph with edge-probability $p$ to a window for $p$ of width roughly $2/n$. to introduce these techniques, a more general discussion of degree constrained subgraphs will be given, including a proof of a recent conjecture on generalized factors of graphs. recently published empirical evidence using statistical physical methods supports our conjecture of a sharp threshold for the appearance of $k$-regular subgraphs of random graphs, while this conjecture, nevertheless, remains open.