On the Unavoidability of Oriented Trees - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Electronic Notes in Theoretical Computer Science Année : 2019

On the Unavoidability of Oriented Trees

Résumé

A digraph is n-unavoidable if it is contained in every tournament of order n. We first prove that every arborescence of order n with k leaves is (n + k − 1)-unavoidable. We then prove that every oriented tree of order n with k leaves is (3 2 n + 3 2 k − 2)-unavoidable and (9 2 n − 5 2 k − 9 2)-unavoidable, and thus (21 8 (n − 1))-unavoidable. Finally, we prove that every oriented tree of order n with k leaves is (n + 144k 2 − 280k + 124)-unavoidable.
Fichier principal
Vignette du fichier
ENTCS.pdf (247.12 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02350215 , version 1 (06-11-2019)

Identifiants

Citer

François Dross, Frédéric Havet. On the Unavoidability of Oriented Trees. Electronic Notes in Theoretical Computer Science, 2019, 346, pp.425-436. ⟨10.1016/j.entcs.2019.08.038⟩. ⟨hal-02350215⟩
41 Consultations
132 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More