Bermond–Thomassen conjecture
For every integer , every finite simple loopless digraph with minimum out-degree contains pairwise vertex-disjoint directed cycles.
References
- An asymptotic bound for the Bermond--Thomassen Conjecture — arXiv — Jørgen Bang-Jensen, Guanghui Wang, Yun Wang
Source: arXiv
Progress summary
A new unrefereed preprint gets close to the conjectured degree threshold, but the exact conjecture remains open.
The conjecture, posed in 1981, asserts that every digraph with minimum out-degree at least contains vertex-disjoint directed cycles.
Known results
- : proved by Thomassen in 1983.
- : proved by Lichiardopol, Pór, and Sereni.
- Tournaments: proved by Bang-Jensen, Bessy, and Thomassé.
- General sufficient thresholds include (Alon) and (Bucić); these do not establish the conjectured bound.
October 2026 asymptotic bound
Jørgen Bang-Jensen, Guanghui Wang, and Yun Wang report an asymptotic result bringing the required degree within a sublinear error of . The preprint is unrefereed, and the exact bound remains unresolved. A separate 2026 preprint proves only a relaxation involving near-directed cycles.
Current status (as of October 2026): The cases and and several restricted classes are settled, while the exact conjecture remains open for every ; an asymptotic advance is claimed but unverified.
Solutions 0
No solutions have been posted yet.