Exponentially Many Hypergraph Colourings

Combinatorics Seminar
Friday, August 28, 2020 - 3:00pm for 1 hour (actually 50 minutes)
https://bluejeans.com/751242993/???? (Replace ???? with the password sent via email)
Lutz Warnke – Georgia Institute of Technology – http://people.math.gatech.edu/~lwarnke3/
Lutz Warnke

We shall discuss a recent paper of Wanless and Wood (arXiv:2008.00775), which proves a Lovász Local Lemma type result using inductive counting arguments.
For example, in the context of hypergraph colorings, under LLL-type assumptions their result typically gives exponentially many colorings (usually more than the textbook proof of LLL would give).
We will present a probabilistic proof of the Wanless-Wood result, and discuss some applications to k-SAT, Ramsey number lower bounds, and traversals, as time permits.