# Bermond, Jean-Claude

## The Bermond-Thomassen Conjecture ★★

\begin{conjecture} For every positive integer $k$, every digraph with minimum out-degree at least $2k-1$ contains $k$ disjoint cycles. \end{conjecture}

Keywords: cycles

Keywords: cycles

- Subject
- Algebra (6)
- Analysis (5)
- Combinatorics (36)
- Geometry (28)
- Graph Theory (222)
- Group Theory (5)
- Logic (10)
- Number Theory (47)
- Theoretical Comp. Sci. (13)
- Topology (40)
- Unsorted (1)

- Author index
- Keyword index