14:30
Extremal Problems on Colourings in Cubic Graphs via the Potts Model
Abstract
We prove tight upper and lower bounds on an observable of the antiferromagnetic Potts model. From this we deduce the case d=3 of a conjecture of Galvin and Tetali on maximising the number of proper colourings in d-regular graphs.