Acyclic coloring;
entropy compression;
local lemma;
D O I:
10.4310/JOC.2016.v7.n4.a8
中图分类号:
O29 [应用数学];
学科分类号:
070104 ;
摘要:
We prove that the acyclic chromatic number of a graph with maximum degree Delta is less than 2.835 Delta(4/3) + Delta. This improves the previous upper bound, which was 50 Delta(4/3). To do so, we draw inspiration from works by Alon, McDiarmid & Reed and by Esperet & Parreau.