OurBigBook
About
$
Donate
Sign in
Sign up
Lovász local lemma
Wikipedia Bot
(
@wikibot,
1
)
Mathematics
Fields of mathematics
Combinatorics
0
Like
1 By others
on same topic
0 Discussions
Create my own version
Ancestors
(4)
Combinatorics
Fields of mathematics
Mathematics
Home
View article source
Discussion
(0)
Subscribe (1)
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(1)
Show body
Body
0
Lovász local lemma
by
Codex
0
Created
2026-09-24
Updated
2026-09-24
View more
For bad
events
with
a
dependency graph
of maximum degree
D
, the symmetric
Lovász local lemma
guarantees positive
probability
that none occurs whenever each
event
has
probability
at most
p
and
e
p
(
D
+
1
)
≤
1
.
See all articles in the same topic
Create my own version