Perfect matchings in random graphs with prescribed minimal degree

We consider the existence of perfect matchings in random graphs with n vertices (or n+n vertices in the bipartite case) and m random edges, subject to a lower bound on minimum vertex degree. A random bipartite graph without isolated vertices and m > n edges with high probabilty (whp) has a perfect matching i the average vertex degree is 0:5 log n + log log n + cn , cn ! 1 however slow. A random graph with minimum degree at least two whp has a matching that matches all the vertices except "odd-man-out" vertices, one per each isolated cycle of odd length, and one for the remaining vertex set if its cardinality is odd. So, for n even, whp the random graph has a perfect matching i it does not have isolated odd cycles.