MAD Phase Transitions in the Oriented Chromatic Number

Abstract

For an oriented graph $G$ the oriented chromatic number of $G$, written $χ_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, Ne{š}et{ř}il, Raspaud, and Sopena proved in 1999 that for all $ε>0$, graphs with maximum average degree less than $4-ε$ have bounded oriented chromatic number. This is in some sense optimal, because $1$-subdivisions of cliques demonstrate that there exists graphs with maximum average degree strictly less than $4$ and oriented chromatic number $Ω(\sqrt{n})$. We prove that for every positive integer $d$, every $d$-degenerate graph $G$ with sufficiently large order satisfies $χ_o(G) \leq 6(1+\frac{9d^2}{4})^{\frac{1}{2}}d 8^{d}\sqrt{n}$. This implies for a fixed $r\geq 4$, the optimal bound for the oriented chromatic number of graphs with maximum average degree less than $r$ is $Θ(\sqrt{n})$. This complements a bound of Wood, who showed that for all $n$ vertex graphs $χ_o \leq 2Δ\sqrt{n-1}$ where $Δ$ is the maximum degree.