Large Matchings in Graphs
Jonathan Weinstein · Canadian Journal of Mathematics · 1974
How large a matching must a graph have? We consider graphs G (finite, undirected, with no loops or multiple edges), with order nG (always ≧ 1) and mG the maximum number of edges in a matching of G. The matchability μG of G is the fraction (2m/n) of nodes covered by a maximum matching.