Graph homomorphisms, partition functions, and extremal problems, Part 1
Guest Speaker: Ewan Davies, Colorado State University 

We survey an area of graph theory motivated by applications to number theory, physics, geometry, and algorithms. The study of graph homomorphisms, independent sets, and colorings has resulted in the development of some of the most influential techniques in probabilistic combinatorics. We focus on one example known as “local occupancy” which has yielded breakthroughs in several areas.

Refreshments will be provided at 3:30.