The talk gives an application of lattice gas theory to probabilistic combinatorics, following a recent paper of Scott and Sokal. There is a large collection of bad events; the problem is to show that there is some non-zero probability that none of them occur. The result is that this probability is bounded below by the partition function of the dependency graph of the events. A subsequent talk w...