Improved bounds on coloring of graphs
Combinatorics
2011-12-07 v2
Abstract
Given a graph with maximum degree , we prove that the acyclic edge chromatic number of is such that . Moreover we prove that: if has girth ; if has girth ; if ; if . We further prove that the acyclic (vertex) chromatic number of is such that . We also prove that the star-chromatic number of is such that . We finally prove that the -frugal chromatic number of is such that , where and are decreasing functions of such that and . To obtain these results we use an improved version of the Lov\'asz Local Lemma due to Bissacot, Fern\'andez, Procacci and Scoppola \cite{BFPS}.
Keywords
Cite
@article{arxiv.1005.1875,
title = {Improved bounds on coloring of graphs},
author = {Sokol Ndreca and Aldo Procacci and Benedetto Scoppola},
journal= {arXiv preprint arXiv:1005.1875},
year = {2011}
}
Comments
Introduction revised. Added references. Corrected typos. Proof of Theorem 2 (items c-f) written in more details