combinatorics / Social Choice, Tournaments
Around the Kemeny median problem, which stays open for $m=3$ and $m=5$ voters, the paper refutes three conjectures on tournament inducibility: both conjectures of Milosz, Hamel and Pierrot (the 3-cycle extension for odd $m\ge5$, and $\mathrm{FAS}=\mathrm{HS}_3$ at $n=11$), and Shepard's threshold conjecture.
Temporal state
No reconciled state yet.
Append-only history
Around the Kemeny median problem, which stays open for $m=3$ and $m=5$ voters, the paper refutes three conjectures on tournament inducibility: both conjectures of Milosz, Hamel and Pierrot (the 3-cycle extension for odd $m\ge5$, and $\mathrm{FAS}=\mathrm{HS}_3$ at $n=11$), and Shepard's threshold conjecture.
Research memory
Around the Kemeny median problem, which stays open for $m=3$ and $m=5$ voters, the paper refutes three conjectures on tournament inducibility: both conjectures of Milosz, Hamel and Pierrot (the 3-cycle extension for odd $m\ge5$, and $\mathrm{FAS}=\mathrm{HS}_3$ at $n=11$), and Shepard's threshold conjecture.
Evidence graph
No public relationships recorded yet.