

A344669


a(n) is the number of preference profiles in the stable marriage problem with n men and n women that generate the maximum possible number of stable matchings.


6




OFFSET

1,2


COMMENTS

A357271 provides the best known lower bounds for the maximum number of stable matchings of order n.
A357269 provides exact results. (End)


LINKS

Matvey Borodin, Eric Chen, Aidan Duncan, Tanya Khovanova, Boyan Litchev, Jiahe Liu, Veronika Moroz, Matthew Qian, Rohith Raghavan, Garima Rastogi, and Michael Voigt, Sequences of the Stable Matching Problem, arXiv:2201.00645 [math.HO], 2021.


FORMULA



EXAMPLE

For n=2, there are 16 possible preference profiles: 14 of them generate one stable matching and 2 of them generate two stable matchings. Thus, a(2) = 2.


CROSSREFS



KEYWORD

nonn,bref,more


AUTHOR



EXTENSIONS



STATUS

approved



