Randomized Borel $(2d+1)$-coloring of digraphs

Anton Bernshteyn, Edward Hou, Forte Shinko +1

Let $G$ be a Borel digraph with maximum out-degree $d\in \mathbb{N}$. We show that $G$ admits a random Borel $(2d+1)$-coloring for which every edge is almost surely not monochroma…