Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree (Q960967): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.disc.2009.03.039 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2069056401 / rank | |||
Normal rank |
Revision as of 03:13, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree |
scientific article |
Statements
Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree (English)
0 references
29 March 2010
0 references
In 1981, \textit{J.C. Bermond} and \textit{C. Thomassen} [``Cycles in digraphs. A survey'', J. Graph Theory 5, 1--43 (1981; Zbl 0458.05035)] conjectured that for any positive integer \(r\), any digraph of minimum out-degree at least \(2r - 1\) contains at least r vertex-disjoint directed cycles. It can be shown that the conjecture is true for \(r = 2\) and \(3\), and that a \(k\)-strongly-connected tournament of order at least \(5k - 3\) contains \(k\) vertex-disjoint directed cycles. The present note gives two proofs of this conjecture for tournaments with minimum in-degree at least \(2r - 1\).
0 references
digraph
0 references
tournament
0 references
cycle
0 references
degree
0 references