Bastien–Khormali link-irregular tournament conjecture
For every integer , a nontrivial link-irregular tournament on vertices exists if and only if ; equivalently, a nontrivial link-irregular tournament of order .
References
- Random Tournaments Are Asymptotically Almost Surely Link-irregular — arXiv — Lily Zhang
Source: arXiv
Progress summary
A new unrefereed preprint claims to settle the conjecture, but its argument has not received independent mathematical assessment.
The conjecture asks whether a link-irregular tournament exists exactly for orders at least . A December 2025 preprint established the lower bound and constructions through order , while leaving the general case unresolved.
Known results
- No tournament exists on vertices; explicit constructions exist for (2025 preprint).
- A regular link-irregular tournament exists on vertices (2025 preprint).
- A computational search reported verification through , without proving all orders (2025 preprint).
October 17, 2026 probabilistic proof claim
Lily Zhang's preprint Random Tournaments Are Asymptotically Almost Surely Link-irregular claims that a random tournament is almost surely link-irregular and thereby supplies existence for every . Combined with the earlier results, this would prove the conjecture, but the claim is unrefereed and unverified.
Current status (as of October 2026): The conjecture is claimed solved for all , with the obstruction and cases established, but the new general proof remains unverified.
Solutions 0
No solutions have been posted yet.