A Step toward the Bermond–Thomassen Conjecture about Disjoint Cycles in Digraphs

In 1981, Bermond and Thomassen conjectured that every digraph with minimum out-degree at least $2k-1$ contains $k$ disjoint cycles. This conjecture is trivial for $k=1$, and was established for $k=2$ by Thomassen in 1983. We verify it for the next case, proving that every digraph with minimum out-de...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	SIAM journal on discrete mathematics 2009-01, Vol.23 (2), p.979-992
Hauptverfasser:	Lichiardopol, Nicolas, Pór, Attila, Sereni, Jean-Sébastien
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied mathematics Computer Science Discrete Mathematics Graph theory Mathematical analysis Neighborhoods
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!