Complete directed minors and chromatic number

Abstract

AbstractThe dichromatic number of a digraph is the smallest for which it admits a ‐coloring where every color class induces an acyclic subgraph. Inspired by Hadwiger's conjecture for undirected graphs, several groups of authors have recently studied the containment of complete directed minors in digraphs with a given dichromatic number. In this note we exhibit a relation of these problems to Hadwiger's conjecture. Exploiting this relation, we show that every directed graph excluding the complete digraph of order as a strong minor or as a butterfly minor is ‐colorable. This answers a question by Axenovich, Girão, Snyder, and Weber, who proved an upper bound of for the same problem. A further consequence of our results is that every digraph of dichromatic number contains a subdivision of every ‐vertex subcubic digraph, which makes progress on a set of problems raised by Aboulker, Cohen, Havet, Lochet, Moura, and Thomassé.