Setting, a random three regular graph. If I start removing edges, what's the probability that I disconnect it? What I know is that if I disconnect a graph I get a subgraph, and that the expected number of copies of a given subgraph goes like $n^{-1}$ where $n$ is number of vertices. Are there any references anyone knows to direct calculations about this question?

Thanks