Colouring Complete Multipartite and Kneser-Type Digraphs

Abstract

The dichromatic number of a digraph $D$ is the smallest $k$ such that $D$ can be partitioned into $k$ acyclic subdigraphs, and the dichromatic number of an undirected graph is the maximum dichromatic number over all its orientations. Extending a well-known result of Lovász, we show that the dichromatic number of the Kneser graph $KG(n,k)$ is $\Theta(n-2k+2)$ and that the dichromatic number of the Borsuk graph $BG(n+1,a)$ is $n+2$ if $a$ is large enough. We then study the list version of the dichromatic number. We show that, for any $\varepsilon>0$ and $2\leq k\leq n^{\frac{1}{2}-\varepsilon}$, the list dichromatic number of $KG(n,k)$ is $\Theta(n\ln n)$. This extends a recent result of Bulankina and Kupavskii on the list chromatic number of $KG(n,k)$, where the same behaviour was observed. We also show that for any $\rho>3$, $r\geq 2$ and $m\geq\max\{\ln^{\rho}r,2\}$, the list dichromatic number of the complete $r$-partite graph with $m$ vertices in each part is $\Theta(r\ln m)$, extending a classical result of Alon. Finally, we give a directed analogue of Sabidussi's theorem on the chromatic number of graph products.