← All problems

Bastien–Khormali link-irregular tournament conjecture

For every integer n≥1n\ge 1, a nontrivial link-irregular tournament on nn vertices exists if and only if n≥6n\ge 6; equivalently, ∃\exists a nontrivial link-irregular tournament of order n⟺n≥6n\Longleftrightarrow n\ge 6.

References

Progress summary

Refreshed
Open · solution reported

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 66. A December 2025 preprint established the lower bound and constructions through order 88, while leaving the general case unresolved.

Known results

  • No tournament exists on 55 vertices; explicit constructions exist for 6≤n≤86 \le n \le 8 (2025 preprint).
  • A regular link-irregular tournament exists on 99 vertices (2025 preprint).
  • A computational search reported verification through n≤100n \le 100, 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 n≥9n \ge 9. 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 nn, with the n=5n=5 obstruction and cases 6≤n≤86 \le n \le 8 established, but the new general proof remains unverified.

Sources

Solutions 0

No solutions have been posted yet.