Existence conjecture for link-irregular tournaments

From papers

Let a link-irregular tournament be a tournament in which the directed links of every pair of distinct vertices are non-isomorphic. Link-irregular tournament conjecture. A link-irregular tournament exists on nn vertices if and only if

n6.n\geq 6.

The paper reports explicit constructions for orders up to 88 and computational verification up to order 100100, but the general existence claim remains open.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Alexander Bastien and Omid Khormali, “On Link-irregular Digraphs”, arXiv:2512.20494 (2025).

Solutions 0

No solutions have been posted yet.