SUMMARY
A classical result of Erdos and Gallai determines the maximum size m(n,?)m(n,\nu) of a graph GG of order nn and matching number ?n\nu n. We show that GG has factorially many maximum matchings provided that its size is sufficiently close to m(n,?)m(n,\nu).