Graphs with the maximum number of proper q-colorings

Series: 
Combinatorics Seminar
Friday, March 7, 2014 - 15:05
1 hour (actually 50 minutes)
Location: 
Skiles 005
,  
Carnegie Mellon
We study an old problem of Linial and Wilf to find the graphs with n vertices and m edges which maximize the number of proper q-colorings of their vertices. In a breakthrough paper, Loh, Pikhurko and Sudakov asymptotically reduced the problem to an optimization problem. We prove the following structural result which tells us how the optimal solutionlooks like: for any instance, each solution of the optimization problem corresponds to either a complete multipartite graph or a graph obtained from a complete multipartite graph by removing certain edges. We then apply this result on optimal graphs to general instances, including a conjecture of Lazebnik from 1989 which asserts that for any q>=s>= 2, the Turan graph T_s(n) has the maximum number of q-colorings among all graphs with the same number of vertices and edges. We disprove this conjecture by providing infinity many counterexamples in the interval s+7 <= q <= O(s^{3/2}). On the positive side, we show that when q= \Omega(s^2) the Turan graph indeed achieves the maximum number of q-colorings. Joint work with Humberto Naves.