Join
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.
Comparing changes
Choose two branches to see what changed, then open a pull request to bring the work across.
Pick two different branches
A pull request can go from any branch into any other.