A new bound on the acyclic edge chromatic number

Paula M.S. Fialho,Bernardo N.B. de Lima,Aldo Procacci

arxiv（2020）

引用 5|浏览5

暂无评分

摘要

In this note we obtain a new bound for the acyclic edge chromatic number a′(G) of a graph G with maximum degree Δ proving that a′(G)≤3.569(Δ−1). To get this result we revisit and slightly modify the method described in Kirousis et al. (2017).

查看译文

关键词

Probabilistic method in combinatorics,Lovász local lemma,Randomized algorithms

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要