← All problems

Bermond–Thomassen conjecture

For every integer k≥1k\ge 1, every finite simple loopless digraph DD with minimum out-degree δ+(D)≥2k−1\delta^+(D)\ge 2k-1 contains kk pairwise vertex-disjoint directed cycles.

References

Source: arXiv

Progress summary

Refreshed
Open · progress reported

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 2k−12k-1 contains kk vertex-disjoint directed cycles.

Known results

  • k=2k=2: proved by Thomassen in 1983.
  • k=3k=3: proved by Lichiardopol, Pór, and Sereni.
  • Tournaments: proved by Bang-Jensen, Bessy, and Thomassé.
  • General sufficient thresholds include 64k64k (Alon) and 18k18k (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 2k−12k-1. 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 k=2k=2 and k=3k=3 and several restricted classes are settled, while the exact conjecture remains open for every k≥4k \ge 4; an asymptotic advance is claimed but unverified.

Sources

Solutions 0

No solutions have been posted yet.