Perfect matchings in random bipartite graphs with minimal degree at least 2

We show that a random bipartite graph with n+n vertices and cn random edges, and minimum degree at least two, has a perfect matching whp. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 26, 2005