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.
机构:
Department of Computer Science, University of Manitoba, CanadaDepartment of Computer Science, University of Manitoba, Canada
Mondal, Debajyoti
Nishat, Rahnuma Islam
论文数: 0引用数: 0
h-index: 0
机构:
Department of Computer Science, University of Victoria, CanadaDepartment of Computer Science, University of Manitoba, Canada
Nishat, Rahnuma Islam
Whitesides, Sue
论文数: 0引用数: 0
h-index: 0
机构:
Department of Computer Science, University of Victoria, CanadaDepartment of Computer Science, University of Manitoba, Canada
Whitesides, Sue
Rahman, Md. Saidur
论文数: 0引用数: 0
h-index: 0
机构:
Graph Drawing and Information Visualization Laboratory, Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology, BangladeshDepartment of Computer Science, University of Manitoba, Canada
机构:
Tel Aviv Univ, Raymond & Beverly Sackler Fac Exact Sci, Dept Math, IL-69978 Tel Aviv, IsraelTel Aviv Univ, Raymond & Beverly Sackler Fac Exact Sci, Dept Math, IL-69978 Tel Aviv, Israel
Alon, N
Zaks, A
论文数: 0引用数: 0
h-index: 0
机构:Tel Aviv Univ, Raymond & Beverly Sackler Fac Exact Sci, Dept Math, IL-69978 Tel Aviv, Israel
机构:
St Petersburg State Univ, Fac Math & Mech, St Petersburg, Russia
Moscow Inst Phys & Technol, Lab Adv Combinator & Network Applicat, Dolgoprudnyi, Russia
Russian Acad Sci, VA Steklov Inst Math, St Petersburg Dept, Moscow, RussiaSt Petersburg State Univ, Fac Math & Mech, St Petersburg, Russia