Bermond, Jean-Claude

Graph Theory » Directed Graphs

The Bermond-Thomassen Conjecture ★★

Author(s): Bermond; Thomassen

Conjecture For every positive integer $k$ , every digraph with minimum out-degree at least $2k-1$ contains $k$ disjoint cycles.

Keywords: cycles

Posted by JS
updated October 1st, 2007

add new comment