Extremes of the internal energy of the Potts model on cubic graphs
From MaRDI portal
Publication:4684327
DOI10.1002/rsa.20767zbMath1401.05108arXiv1610.08496OpenAlexW2541525350MaRDI QIDQ4684327
Matthew Jenssen, Will Perkins, Ewan Davies, Barnaby Roberts
Publication date: 28 September 2018
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.08496
Graph polynomials (05C31) Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)
Related Items (8)
Extremal Regular Graphs: Independent Sets and Graph Homomorphisms ⋮ A proof of Tomescu's graph coloring conjecture ⋮ On the number of independent sets in uniform, regular, linear hypergraphs ⋮ Counting proper colourings in 4-regular graphs via the Potts model ⋮ Extremal colorings and independent sets ⋮ Counting independent sets in cubic graphs of given girth ⋮ The number of independent sets in an irregular graph ⋮ A reverse Sidorenko inequality
This page was built for publication: Extremes of the internal energy of the Potts model on cubic graphs
