Let's $G=(U,V,E)$ be a random balanced Bipartite graph graph which $|U|=|V|=n$.
What is the number of random graphs that has a perfect matching?
I think that the number of possible graphs is $2^{n^2}$, but I can't find how many of them has a perfect match.