Subdivisions in dicritical digraphs with large order or digirth - INRIA 2
Journal Articles European Journal of Combinatorics Year : 2024

Subdivisions in dicritical digraphs with large order or digirth

Abstract

Aboulker et al. proved that a digraph with large enough dichromatic number contains any fixed digraph as a subdivision. The dichromatic number of a digraph is the smallest order of a partition of its vertex set into acyclic induced subdigraphs. A digraph is dicritical if the removal of any arc or vertex decreases its dichromatic number. In this paper we give sufficient conditions on a dicritical digraph of large order or large directed girth to contain a given digraph as a subdivision. In particular, we prove that (i) for every integers $k,\ell$, large enough dicritical digraphs with dichromatic number $k$ contain an orientation of a cycle with at least $\ell$ vertices; (ii) there are functions $f,g$ such that for every subdivision $F^*$ of a digraph $F$, digraphs with directed girth at least $f(F^*)$ and dichromatic number at least $g(F)$ contain a subdivision of $F^*$, and if $F$ is a tree, then $g(F)=|V(F)|$; (iii) there is a function $f$ such that for every subdivision $F^*$ of $TT_3$ (the transitive tournament on three vertices), digraphs with directed girth at least $f(F^*)$ and minimum out-degree at least $2$ contain $F^*$ as a subdivision.
Fichier principal
Vignette du fichier
2401.05938.pdf (297.12 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-04471653 , version 1 (21-02-2024)

Licence

Identifiers

Cite

Lucas Picasarri-Arrieta, Clément Rambaud. Subdivisions in dicritical digraphs with large order or digirth. European Journal of Combinatorics, 2024, 122, pp.104022. ⟨10.1016/j.ejc.2024.104022⟩. ⟨hal-04471653⟩
297 View
29 Download

Altmetric

Share

More