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 probability (whp) has a perfect matching iff the average vertex degree is \( 0.5\log n + \log \log n + c_n ,c_n \to \infty \) 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 if it does not have isolated odd cycles.

[1]  Béla Bollobás,et al.  Random Graphs , 1985 .

[2]  Nicholas C. Wormald,et al.  Almost All Regular Graphs Are Hamiltonian , 1994, Random Struct. Algorithms.

[3]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[4]  L. Lovász.  Combinatorial problems and exercises , 1979 .

[5]  Richard M. Karp,et al.  Maximum Matchings in Sparse Random Graphs , 1981, FOCS 1981.

[6]  Alan M. Frieze,et al.  Maximum matchings in sparse random graphs: Karp-Sipser revisited , 1998, Random Struct. Algorithms.

[7]  B. Bollobás.  The evolution of random graphs , 1984 .

[8]  A. Frieze.  ON MATCHINGS AND HAMILTON CYCLES IN RANDOM GRAPHS , 1988 .

[9]  G. V. Balakin.  On Random Matrices , 1967 .

[10]  David W. Walkup,et al.  Matchings in random regular bipartite digraphs , 1980, Discret. Math..

[11]  P. Erdos,et al.  On the existence of a factor of degree one of a connected random graph , 1966 .

[12]  Nicholas C. Wormald,et al.  Random Matchings Which Induce Hamilton Cycles and Hamiltonian Decompositions of Random Regular Graphs , 2001, J. Comb. Theory, Ser. B.

[13]  M. Stephanov,et al.  Random Matrices , 2005, hep-ph/0509286.

[14]  Alan M. Frieze.  Maximum matchings in a class of random graphs , 1986, J. Comb. Theory, Ser. B.

[15]  A. RÉNY,et al.  ON THE EXISTENCE OF A FACTOR OF DEGREE ONE OF A CONNECTED RANDOM GRAPH , 2004 .

[16]  Béla Bollobás,et al.  On matchings and hamiltonian cycles in random graphs Annals of Discrete Mathematics 28 , 1985 .

[17]  Boris Pittel,et al.  Probabilistic Analysis of an Algorithm in the Theory of Markets in Indivisible Goods , 1995 .