A note on acyclic vertex-colorings

被引:7
|
作者
Sereni, Jean-Sebastien [1 ]
Volec, Jan [2 ,3 ,4 ]
机构
[1] CNRS, LORIA, Vandoeuvre Les Nancy, France
[2] ETH, Dept Math, CH-8092 Zurich, Switzerland
[3] Univ Warwick, Inst Math, Coventry CV4 7AL, W Midlands, England
[4] Univ Warwick, DIMAP, Coventry CV4 7AL, W Midlands, England
关键词
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.
引用
收藏
页码:725 / 737
页数:13
相关论文
共 50 条