@article {IOPORT.06100741,
    author       = {Frieze, Alan and Melsted, P\'all},
    title        = {Maximum matchings in random bipartite graphs and the space utilization of Cuckoo hash tables.},
    year         = {2012},
    journal      = {Random Structures \& Algorithms},
    volume       = {41},
    number       = {3},
    issn         = {1042-9832},
    pages        = {334-364},
    publisher    = {John Wiley \& Sons, Inc., New York, NY},
    doi          = {10.1002/rsa.20427},
    abstract     = {Summary: We study the the following question in random graphs. We are given two disjoint sets $L,R$ with $|L| = n$ and $|R| = m$. We construct a random graph $G$ by allowing each $x\in L$ to choose $d$ random neighbours in $R$. The question discussed is as to the size $\mu (G)$ of the largest matching in $G$. When considered in the context of cuckoo hashing, one key question is as to when is $\mu (G) = n$ whp? We answer this question exactly when $d$ is at least three.},
    identifier   = {06100741},
}