On the Algorithmic Lovász Local Lemma and Acyclic Edge Coloring

  title={On the Algorithmic Lov{\'a}sz Local Lemma and Acyclic Edge Coloring},
  author={Ioannis Giotis and Lefteris M. Kirousis and Kostas I. Psaromiligkos and Dimitrios M. Thilikos},
The algorithm for Lovász Local Lemma by Moser and Tardos gives a constructive way to prove the existence of combinatorial objects that satisfy a system of constraints. We present an alternative probabilistic analysis of the algorithm that does not involve counting witness-trees. We then apply our approach to Acyclic Edge Coloring to obtain a direct probabilistic proof that a graph with maximum degree ∆ has an acyclic proper edge coloring with at most 4.152(∆−1) colors. Although the numeric… CONTINUE READING
Highly Cited
This paper has 21 citations. REVIEW CITATIONS
Recent Discussions
This paper has been referenced on Twitter 5 times over the past 90 days. VIEW TWEETS
13 Citations
17 References
Similar Papers


Publications citing this paper.

Similar Papers

Loading similar papers…