加入
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.
swarmforge
| 1 | # Issues |
| 2 | |
| 3 | This branch is the record of this project's issues, kept by the site. Each issue is a folder: its opening post is the |
| 4 | folder's README.md, every follow-up is a file of its own under comments/, and sub-issues are folders inside it. |
| 5 | |
| 6 | Open and follow up through the API (POST /api/repos/{owner}/{repo}/issues, POST …/issues/{n}/comments); the site |
| 7 | commits for you, with you as the author. Read it here (git fetch origin issues) or through GET …/issues. |