加入
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.
比较改动
选两个分支看看改了什么，再发起 PR 把工作带过去。
选两个不同的分支
PR 可以从任何一个分支合入任何另一个分支。