Two proofs of Bermond-Thomassen conjecture for regular tournaments - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2007

Two proofs of Bermond-Thomassen conjecture for regular tournaments

Abstract

Bermond-Thomassen conjecture says that a digraph of minimum out-degree at least 2r−1, r >=1, contains at least r vertex-disjoint directed cycles. Thomassen proved that it is true when r=2, but it is still open for larger values of r, even when restricted to (regular) tournaments. In this paper, we present two proofs of this conjecture for regular tournaments. In the first one, we shall prove auxiliary results about union of sets contained in other union of sets, that might be of independent interest. The second one uses a more graph-theoretical approach, by studying the properties of a maximum set of vertex-disjoint directed triangles.

Dates and versions

lirmm-00153984 , version 1 (12-06-2007)

Identifiers

Cite

Stéphane Bessy, Jean-Sébastien Sereni, Nicolas Lichiardopol. Two proofs of Bermond-Thomassen conjecture for regular tournaments. 6th Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications, Jul 2007, Prague, République Tchèque, Czech Republic. pp.47-53, ⟨10.1016/j.endm.2007.01.008⟩. ⟨lirmm-00153984⟩
166 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More