Probability of arising of simple graph in configuration model
Consider a simple $d$-regular graph. For each vertex, assign numbers from $1$ to $d$ to the edges adjacent to it. There are $(d!)^n$ ways to do so. Each such assignment corresponds to a particular perfect matching in the configuration model, and vice versa.