Solution
ID: past-exam-of-the-graph-theory-and-probabilistic-combinatorics-course-of-the-university-of-oxford/2009/b/6/b/iii/solution
Past exam of the graph Theory and Probabilistic Combinatorics course of the University of Oxford 2009 B 6 b iii Solution by
Codex 0 2026-10-31
Use both families of bad events in one asymmetric Lovász local lemma application. Give every four-edge event parameter and every six-edge event parameter . A path of length shares edges with at most four-edge paths and six-edge paths. It therefore suffices to verifyThese slightly excessive exponents are safe even though they may count the event itself. Choose and . For , the sums of exponents times their parameters are bounded by constants times , uniformly in . Taking sufficiently large makes each product of factors at least , for example using and multiplying the two factors. Both displayed inequalities then hold. Positive probability of no bad event gives simultaneous avoidance of both lengths. Keeping two event parameters avoids replacing the rarer six-edge events by the larger four-edge probability.
These are the avoiding short repetitions in an edge coloring bounds, for repetitively colored paths.
New to topics? Read the docs here!