Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Mathematics Année : 2010

Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree

Résumé

The Bermond-Thomassen conjecture states that, for any positive integer r, a digraph of minimum out-degree at least 2r − 1 contains at least r vertex-disjoint directed cycles. Thomassen proved that it is true when r = 2, and very recently the conjecture was proved for the case where r = 3. 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 tournaments with minimum in-degree at least 2r − 1. In particular, this shows that the conjecture is true for almost regular tournament. In the first proof, we 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.
Fichier principal
Vignette du fichier
BLS10.pdf (143.74 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00487977 , version 1 (31-05-2010)

Identifiants

Citer

Stéphane Bessy, Nicolas Lichiardopol, Jean-Sébastien Sereni. Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree. Discrete Mathematics, 2010, 310 (3), pp.557--560. ⟨10.1016/j.disc.2009.03.039⟩. ⟨hal-00487977⟩
212 Consultations
135 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More