English

Improved bounds on coloring of graphs

Combinatorics 2011-12-07 v2

Abstract

Given a graph GG with maximum degree Δ3\Delta\ge 3, we prove that the acyclic edge chromatic number a(G)a'(G) of GG is such that a(G)9.62(Δ1)a'(G)\le\lceil 9.62 (\Delta-1)\rceil. Moreover we prove that: a(G)6.42(Δ1)a'(G)\le \lceil 6.42(\Delta-1)\rceil if GG has girth g5g\ge 5\,; a(G)5.77(Δ1)\rca'(G)\le \lceil5.77 (\Delta-1)\rc if GG has girth g7g\ge 7; a(G)\lc4.52(\D1)\rca'(G)\le \lc4.52(\D-1)\rc if g53g\ge 53; a(G)\D+2a'(G)\le \D+2\, if g25.84\Dlog\D(1+4.1/log\D)g\ge \lceil25.84\D\log\D(1+ 4.1/\log\D)\rceil. We further prove that the acyclic (vertex) chromatic number a(G)a(G) of GG is such that a(G)\lc6.59Δ4/3+3.3\D\rca(G)\le \lc 6.59 \Delta^{4/3}+3.3\D\rc. We also prove that the star-chromatic number χs(G)\chi_s(G) of GG is such that χs(G)\lc4.34Δ3/2+1.5\D\rc\chi_s(G)\le \lc4.34\Delta^{3/2}+ 1.5\D\rc. We finally prove that the \b\b-frugal chromatic number χ\b(G)\chi^\b(G) of GG is such that χ\b(G)\lcmax{k1(\b)\D,  k2(\b)\D1+1/\b/(\b!)1/\b}\rc\chi^\b(G)\le \lc\max\{k_1(\b)\D,\; k_2(\b){\D^{1+1/\b}/ (\b!)^{1/\b}}\}\rc, where k1(\b)k_1(\b) and k2(\b)k_2(\b) are decreasing functions of \b\b such that k1(\b)[4,6]k_1(\b)\in[4, 6] and k2(\b)[2,5]k_2(\b)\in[2,5]. 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

R2 v1 2026-06-21T15:21:19.804Z