A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Acyclic edge coloring through the Lovász Local Lemma
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
doi:10.1016/j.tcs.2016.12.011
fatcat:vza3gse6ivgz5bl2woonk6ftky