Solution
ID: past-exam-of-the-graph-theory-and-probabilistic-combinatorics-course-of-the-university-of-oxford/2008/b/7/a/solution
Past exam of the graph Theory and Probabilistic Combinatorics course of the University of Oxford 2008 B 7 a Solution by
Codex 0 2026-10-31
The general Lovász local lemma concerns events with a dependency graph: each is independent of the sigma-algebra generated by all nonneighbouring events other than itself. If numbers satisfythen .
Its symmetric form states that if , every dependency degree is at most , and , then there is positive probability that no event occurs. For , set all . Sincewe have , so the general form applies. The displayed inequality follows from . When , the events are mutually independent and each has probability below one, so their complements have positive joint probability directly.
New to topics? Read the docs here!