I have the following problem and honestly i don't know how to start working on it. Any clue will be appreciated.
I need to calculate the probability that following the Erdos-Renyi model, a random bipartite graph $G(n,n,m)$ with exactly m=2n edges (each edge appears with probability $p$) is the union of edge-disjoint simple cycles.
Any reference, clue or hint will be appreciated. Thanks.