Counting Proper Colourings in 4-Regular Graphs via the Potts Model

Electronic Journal Of Combinatorics

Ewan Davies¹ 

关键词: Graph colouring;    Potts model;    Graph homomorphisms;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

We give tight upper and lower bounds on the internal energy per particle in the antiferromagnetic $q$-state Potts model on $4$-regular graphs, for $q\ge 5$. This proves the first case of a conjecture of the author, Perkins, Jenssen and Roberts, and implie

【 授权许可】

Others