I was wondering if anyone could point me in the direction of a text or paper which would help deal with the following problem
Suppose i am given a $K_{\mathrm{log}(n)} \times K_{\mathrm{log}(n)}$ bipartite graph in which edges occur randomly with probability $p(n)$, i want to find the size of the largest matching w.h.p for certain values of $p$.