Acyclic edge coloring through the Lovász Local Lemma

Ioannis Giotis, Lefteris Kirousis, Kostas I. Psaromiligkos, Dimitrios M. Thilikos
2017 Theoretical Computer Science  
We give a probabilistic analysis of a Moser-type algorithm for the Lovász Local Lemma (LLL), adjusted to search for acyclic edge colorings of a graph. We thus improve the best known upper bound to acyclic chromatic index, also obtained by analyzing a similar algorithm, but through the entropic method (basically counting argument). Specifically we show that a graph with maximum degree ∆ has an acyclic proper edge coloring with at most ⌈3.74(∆ − 1)⌉ + 1 colors, whereas, previously, the best bound
more » ... was 4(∆ − 1). The main contribution of this work is that it comprises a probabilistic analysis of a Moser-type algorithm applied to events pertaining to dependent variables.
doi:10.1016/j.tcs.2016.12.011 fatcat:vza3gse6ivgz5bl2woonk6ftky