Preprint
Aug 2026
A relaxation of the Bermond-Thomassen conjecture
The well-known Bermond-Thomassen conjecture states that every digraph of minimum out-degree at least $2k-1$ contains $k$ vertex-disjoint directed cycles. Despite being posed in 1981, this conjecture remains unresolved for all $k \ge 4$. We prove a relaxation of this conjecture: every digraph $D$ of minimum out-degree a...
S. Bessy, M. Muis, Jean-Sébastien Sereni et al.
· 1 citation