A number of stable matchings in models of the Gale–Shapley type

We give some upper bounds on the maximum number of stable matchings in the Gale–Shapley marriage model with nn men and nn women. We also characterize, with the use of some graph-theoretical notions, the exact number of such matchings, assuming that the preferences of men and women are given.