A 2.81 n upper bound on the number of stable matchings
cs.DS, cs.DM, math.CO
Submitted: 2026-11-04
Updated: 2026-11-04
Code: https://github.com/ebrahim-ghorbani/stable-matching
Terminology
Sources
- Representing All Stable Matchings by Walking a Maximal Chain
- Stable matchings with correlated Preferences
- A Single-Exponential Time Algorithm for the Maximum-Cardinality Weakly Stable Matching Problem with Ties and Incomplete Lists
Related papers
- Exploiting Low Scanwidth to Resolve Soft Polytomies
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time