Title: Applications of the entropy method: Counting proper colorings of a regular graph
|Affiliation:||University of Waterloo|
Abstract: Following Section 6 of Galvin's notes on Entropy and Counting, we will explore Galvin and Tetali’s tight upper bound of the number of homomorphisms to a fixed graph admitted by a regular bipartite graph, generalizing an earlier special case, independent sets, proved using entropy by Kahn. Several open problems will also be presented if time permits.
200 University Avenue West
Waterloo, ON N2L 3G1