Abstract
Based on the algorithmic proof of Lovász local lemma due to Moser and Tardos, Dujmović et al. (2016) initiated the use of the so-called entropy compression method for graph coloring problems. Then, using the same approach Esperet and Parreau (2013) proved new upper bounds for several chromatic numbers, and explained how that approach could be used for many different coloring problems. Here, we follow this line of research for the particular case of acyclic coloring: we show that every graph with maximum degree \Delta has acyclic chromatic number at most \frac{3}{2}\Delta^\frac{4}{3}+0(\Delta).