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.
Pull requests
Pull requests bring work from one route into another; merging one adopts it.