( #» P 6 , triangle)-free digraphs have bounded dichromatic number - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2023

( #» P 6 , triangle)-free digraphs have bounded dichromatic number

Résumé

The dichromatic number of an oriented graph is the minimum size of a partition of its vertices into acyclic induced subdigraphs. We prove that oriented graphs with no induced directed path on six vertices and no triangle have bounded dichromatic number. This is one (small) step towards the general conjecture asserting that for every oriented tree T and every integer k, any oriented graph that does not contain an induced copy of T nor a clique of size k has dichromatic number at most some function of k and T .
Fichier principal
Vignette du fichier
2212.02272.pdf (153.43 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03985871 , version 1 (13-02-2023)

Identifiants

  • HAL Id : hal-03985871 , version 1

Citer

Pierre Aboulker, Guillaume Aubian, Pierre Charbit, Stéphan Thomassé. ( #» P 6 , triangle)-free digraphs have bounded dichromatic number. 2023. ⟨hal-03985871⟩
9 Consultations
15 Téléchargements

Partager

Gmail Facebook X LinkedIn More