MAD Phase Transitions in the Oriented Chromatic Number
For an oriented graph $G$ the oriented chromatic number of $G$, written $\chi_o(G)$, is the least integer $t$ such that $G$ has a homomorphism to a tournament on $t$ vertices. The oriented chromatic number of a simple graph $H$ is the maximum oriented chromatic number over all orientations of $H$. Borodin, Kostochka, N...