Majority choosability of digraphs

Marcin Anholcer, Bartłomiej Bosek, Jarosław Grytczuk

A \emph{majority coloring} of a digraph is a coloring of its vertices such that for each vertex $v$, at most half of the out-neighbors of $v$ has the same color as $v$. A digraph $…