Directed Lovász local lemma and Shearer's lemma
From MaRDI portal
Publication:2294597
DOI10.1007/s10472-019-09671-5zbMath1477.68534arXiv1611.00502OpenAlexW2989678884WikidataQ124813178 ScholiaQ124813178MaRDI QIDQ2294597
Kostas I. Psaromiligkos, John Livieratos, Lefteris M. Kirousis
Publication date: 11 February 2020
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1611.00502
Graph theory (including graph drawing) in computer science (68R10) Combinatorial probability (60C05) Randomized algorithms (68W20)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Lopsided Lovász Local lemma and Latin transversals
- On a problem of Spencer
- A multivariate Lagrange inversion formula for asymptotic calculations
- Random Walks That Find Perfect Objects and the Lovász Local Lemma
- A constructive proof of the general lovász local lemma
- The Lovász Local Lemma – A Survey
- A constructive proof of the Lovász local lemma
- On the Algorithmic Lovász Local Lemma and Acyclic Edge Coloring
- Upper Bounds on the Size of Covering Arrays
- Lopsidependency in the Moser-Tardos framework: Beyond the Lopsided Lovász Local Lemma
- A constructive algorithm for the Lovász Local Lemma on permutations
- Moser and tardos meet Lovász
This page was built for publication: Directed Lovász local lemma and Shearer's lemma