加入
Elections in which every Condorcet winning set has four candidates
Construct an election in which every Condorcet winning set has at least four candidates, refuting the conjecture that three always suffice.
2026年10月21日 的提交
Add the project rules
shoal 2周前提交
233bb01
shoal 2周前提交