Fetching the paper…
Reading the bibliography…
The Lovasz Local Lemma is a seminal result in probabilistic combinatorics.
Remarks on the FKG inequalities
Richard Holley · 1974
Earlier work this paper cites.
Problems and results on 3-chromatic hypergraphs and some related questions
Paul Erdös and László Lovász · 1975
Earlier work this paper cites.
Asymptotic lower bounds for Ramsey functions
Joel Spencer · 1977
Earlier work this paper cites.
On a problem of Spencer
James B. Shearer · 1985
Earlier work this paper cites.
Generating random spanning trees
Andrei Broder · 1989
Earlier work this paper cites.
The Lopsided Lovász Local Lemma and Latin transversals
Paul Erdös and Joel Spencer · 1991
Earlier work this paper cites.
On the complexity of the parity argument and other inefficient proofs of existence
Christos H. Papadimitriou · 1994
Earlier work this paper cites.
Covering with latin transversals
Noga Alon, Joel Spencer, and Prasad Tetali · 1995
Earlier work this paper cites.
Multicolored trees in complete graphs
Richard A. Brualdi and Susan Hollingsworth · 1996
Earlier work this paper cites.
On the existence of rainbows in 1-factorizations of K 2 n K_{2n}
David E. Woolbright and Hung-Lin Fu · 1998
Earlier work this paper cites.
The Probabilistic Method
N. Alon and J. Spencer · 2000
Earlier work this paper cites.
Combinatorial Optimization: Polyhedra and Efficiency
Alexander Schrijver · 2004
Earlier work this paper cites.
The Repulsive Lattice Gas, the Independent-Set Polynomial, and the Lovász Local Lemma
Alexander D. Scott and Alan D. Sokal · 2005
Earlier work this paper cites.
Multicolored trees in complete graphs
Saieed Akbari and Alireza Alipour · 2007
Cited alongside, same era.
Cluster expansion for abstract polymer models: New bounds from an old approach
R. Fernández and A. Procacci · 2007
Cited alongside, same era.
A constructive proof of the Lovász local lemma
Robin A. Moser · 2009
Cited alongside, same era.
A constructive proof of the general Lovász Local Lemma
Robin A. Moser and Gábor Tardos · 2010
Cited alongside, same era.
An improvement of the Lovász local lemma via cluster expansion
R. Bissacot, R. Fernández, A. Procacci, and B. Scoppola · 2011
Cited alongside, same era.
The local lemma is tight for SAT
Heidi Gebauer, Tibor Szabó, and Gábor Tardos · 2011
Cited alongside, same era.
Edge-disjoint rainbow spanning trees in complete graphs, 2013
James M. Carraher, Stephen G. Hartke, and Paul Horn · 2013
Later among the works it cites.
Deterministic algorithms for the Lovász local lemma
Karthekeyan Chandrasekaran, Navin Goyal, and Bernhard Haeupler · 2013
Later among the works it cites.
Quest for negative dependency graphs
Lincoln Lu, Austin Mohr, and László Székely · 2013
Later among the works it cites.
Applications of the lopsided Lovász local lemma regarding hypergraphs
Austin Mohr · 2013
Later among the works it cites.
Random walks that find perfect objects and the Lovász local lemma
Dimitris Achlioptas and Fotis Iliopoulos · 2014
Later among the works it cites.
Distributed algorithms for the Lovász local lemma and graph coloring
Kai-Min Chung, Seth Pettie, and Hsin-Hao Su · 2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
New constructive aspects of the Lovász local lemma
Bernhard Haeupler, Barna Saha, and Aravind Srinivasan · 2011
Cited alongside, same era.
Moser and Tardos meet Lovász
Kashyap Kolipaka and Mario Szegedy · 2011
Cited alongside, same era.
Algorithmic improvements of the Lovász local lemma via cluster expansion
Dimitris Achlioptas and Themis Gouleakis · 2012
Cited alongside, same era.
Properly coloured copies and rainbow copies of large graphs with small maximum degree
Julia Böttcher, Yoshiharu Kohayakawa, and Aldo Procacci · 2012
Cited alongside, same era.
A sharper local lemma with improved applications
Kashyap Kolipaka, Mario Szegedy, and Yixin Xu · 2012
Cited alongside, same era.
Exact Algorithms for Constraint Satisfaction Problems
Robin Moser · 2012
Cited alongside, same era.
A constructive algorithm for the Lovász Local Lemma on permutations
David G. Harris and Aravind Srinivasan · 2014
Later among the works it cites.
An extension of the Moser-Tardos algorithmic local lemma
Wesley Pegden · 2014
Later among the works it cites.
Random walks that find perfect objects and the Lovász local lemma
Dimitris Achlioptas and Fotis Iliopoulos · 2015
Closest in time.
On the algorithmic Lovász local lemma and acyclic edge coloring
Ioannis Giotis, Lefteris Kirousis, Kostas I. Psaromiligkos, and Dimitrios M. Thilikos · 2015
Closest in time.
The art of computer programming, Volume 4B (draft, pre-fascicle 6a), 2015
Donald E. Knuth · 2015
Closest in time.
Focused stochastic local search and the Lovász local lemma
Dimitris Achlioptas and Fotis Iliopoulos · 2016
Closest in time.