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 L. Kirousis and Kostas I. Psaromiligkos and D. Thilikos},
  • Ioannis Giotis, L. Kirousis, +1 author D. Thilikos
  • Published in ANALCO 2015
  • Computer Science, Mathematics
  • The algorithm for Lovasz 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 reconstructing the history of the algorithm from the witness tree. We apply our technique to improve the best known upper bound to acyclic chromatic index. Specifically we show that a graph with maximum degree Δ has an acyclic proper edge… CONTINUE READING
    Acyclic edge coloring through the Lovász Local Lemma
    • 22
    • Open Access
    An Algorithmic Proof of the Lopsided Lovasz Local Lemma
    • 14
    • Open Access
    Directed Lovász local lemma and Shearer’s lemma
    An Algorithmic Proof of the Lovasz Local Lemma via Resampling Oracles
    • 55
    • Open Access
    An interactive version of Lovász local lemma: Arthur and Merlin implement Moser's algorithm
    Commutativity in the Algorithmic Lovász Local Lemma
    • 19
    • Open Access
    Commutativity in the Algorithmic Lovász Local Lemma Vladimir Kolmogorov
    • 1
    • Open Access


    Publications referenced by this paper.
    An Algorithmic Approach to the Lovász Local Lemma. I
    • J. Beck
    • Mathematics, Computer Science
    • 1991
    • 266
    Acyclic edge-coloring using entropy compression
    • 67
    • Highly Influential
    • Open Access
    Improved algorithmic versions of the Lovász Local Lemma
    • 56
    • Open Access
    A constructive proof of the Lovász local lemma
    • R. Moser
    • Mathematics, Computer Science
    • 2009
    • 162
    • Highly Influential
    • Open Access
    Robin Moser makes Lovász Local Lemma Algorithmic ! Notes of
    • 3
    • Open Access
    Entropy compression method applied to graph colorings
    • 40
    • Open Access
    A constructive proof of the general lovász local lemma
    • 427
    • Highly Influential
    • Open Access
    A parallel algorithmic version of the local lemma
    • 93
    • Open Access
    Problems and Results on 3-chromatic Hypergraphs and Some Related Questions
    • P. Erdos-L Lovász
    • 280
    • Highly Influential
    • Open Access