Paper detail

An Improved Bound of Acyclic Vertex-Coloring

The acyclic chromatic number of a graph is the least number of colors needed to properly color its vertices so that none of its cycles has only two colors. We show that for all $α>2^{-1/3}$ there exists an integer $Δ_α$ such that if the maximum degree $Δ$ of a graph is at least $Δ_α$, then the acyclic chromatic number of the graph is at most $\lceilαΔ^{4/3} \rceil +Δ+ 1$. The previous best bound, due to Gonçalves et al (2020), was $(3/2) Δ^{4/3} + O(Δ)$.