L. Picasarri-Arrieta

Coloring digraphs with $\Delta-b$ colors

The dichromatic number of a digraph is the minimum number of colors needed to partition its vertex set into acyclic subdigraphs. A biclique is a set of vertices inducing all possible pairs of opposite arcs. For a digraph $D$, define $\Delta(D) = \max_{v\in V(D)} \sqrt{d^+(v) \cdot d^-(v)}$. We prove that, for every fix...