Statements (19)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
events with limited dependencies
|
| gptkbp:describes |
probabilistic method
|
| gptkbp:field |
gptkb:probability_theory
combinatorics |
| gptkbp:generalizes |
gptkb:Lovász_Local_Lemma
|
| gptkbp:hasAlgorithmicVersion |
gptkb:Moser–Tardos_algorithm
|
| gptkbp:hasVariant |
asymmetric version
symmetric version |
| https://www.w3.org/2000/01/rdf-schema#label |
Erdős–Lovász Local Lemma
|
| gptkbp:importantFor |
non-constructive existence proofs
|
| gptkbp:namedAfter |
gptkb:Paul_Erdős
gptkb:László_Lovász |
| gptkbp:state |
If events are mostly independent and each has small probability, then with positive probability none of the events occur
|
| gptkbp:usedIn |
theoretical computer science
graph theory |
| gptkbp:yearProposed |
1975
|
| gptkbp:bfsParent |
gptkb:Lovász_Local_Lemma
|
| gptkbp:bfsLayer |
6
|