Strong conjecture on F-irregular oriented graphs
For every weakly connected oriented graph with , there exist infinitely many oriented graphs such that, for every pair of distinct vertices , .
References
- Every tournament T of order at least 3 admits infinitely many T-irregular oriented graphs — arXiv — Tatiana Dovzhenok
Source: arXiv
Progress summary
A new construction handles every tournament, but the broader claim for all weakly connected oriented graphs remains open.
The strong conjecture predicts infinitely many -irregular oriented graphs for every weakly connected oriented graph with at least three vertices. The newly reported result addresses all tournaments but does not settle the full conjecture.
Known results
- Dovzhenok, Lukashenko, and Filiuta proved the conjecture for every oriented cycle .
- Their work gives exact smallest orders for non-trivial - and -irregular oriented graphs: and , respectively.
November 2, 2026: tournament case
Tatiana Dovzhenok reports that every tournament of order at least admits infinitely many irregular oriented graphs, using vertex cloning for tournaments of order at least . This is claimed as a constructive settlement of the tournament case, while arbitrary weakly connected oriented graphs remain untreated.
Current status (as of November 2026): The tournament case and the oriented-cycle case are claimed results, but the strong conjecture for all weakly connected oriented graphs remains open.
Solutions 0
No solutions have been posted yet.