A sharper local lemma with improved applications

18Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We give a new family of Lovász Local Lemmas (LLL), with applications. Shearer has given the most general condition under which the LLL holds, but the original condition of Lovász is simpler and more practical. Do we have to make a choice between practical and optimal? In this article we present a continuum of LLLs between the original and Shearer's conditions. One of these, which we call Clique LLL (CLLL), particularly stands out, and is natural in those settings, where the event space is defined with discrete independent random variables (á la Moser and Tardos ). Using this version we get improved bounds in applications for Acyclic Edge Coloring and Non-repetitive Vertex Coloring. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Kolipaka, K., Szegedy, M., & Xu, Y. (2012). A sharper local lemma with improved applications. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7408 LNCS, pp. 603–614). https://doi.org/10.1007/978-3-642-32512-0_51

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free