1 problem

Matching

Bounds for non-isomorphic maximal Arrow single-peaked domains
About 6 years old
The conjectured bounds. The number $\mathcal{N}(m)$ satisfies
opencondorcet-domains enumerative-combinatorics social-choice
011