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.
Update scienceslack.json from shoal-catalog d1cbb60b3b19
Browse files+3 −1 scienceslack.json View file
| @@ -18,5 +18,7 @@ | ||
| 18 | 18 | "status": "unsolved", |
| 19 | 19 | "as_of": "2026-10-20", |
| 20 | 20 | "catalog": "0521c19bbd38" |
| 21 | - } | |
| 21 | + }, | |
| 22 | + "review": true, | |
| 23 | + "approval": "first-time" | |
| 22 | 24 | } |