Subdivisions of oriented cycles in digraphs with large chromatic number - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

Subdivisions of oriented cycles in digraphs with large chromatic number

Résumé

Extended Abstract The chromatic number χ(D) of a digraph D is the chromatic number of its underlying graph. An oriented cycle is an orientation of a undirected cycle. We first show that for any oriented cycle C, there are digraphs containing no subdivision of C (as a subdigraph) and arbitrarily large chromatic number. In contrast, we show that for any cycle with two blocks C, every strongly connected digraph with sufficiently large chromatic number contains a subdivision of C. More generally, we conjecture that this result holds for any oriented cycle. As a further evidence, we prove this conjecture for the antidirected cycle on four vertices (in which two vertices have out-degree 2 and two vertices have in-degree 2).
Fichier principal
Vignette du fichier
finalversion.pdf (226.26 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01411115 , version 1 (07-12-2016)

Identifiants

  • HAL Id : hal-01411115 , version 1

Citer

Nathann Cohen, Frédéric Havet, William Lochet, Nicolas Nisse. Subdivisions of oriented cycles in digraphs with large chromatic number. Bordeaux Graph Wokshop 2016, Nov 2016, Bordeaux, France. pp.85-88. ⟨hal-01411115⟩
960 Consultations
152 Téléchargements

Partager

Gmail Facebook X LinkedIn More