A tree-decomposed transfer matrix for computing exact Potts model partition functions for arbitrary graphs, with applications to planar graph colourings

DOI10.1088/1751-8113/43/38/385001zbMath1200.82004arXiv1003.4847WikidataQ58082275 ScholiaQ58082275MaRDI QIDQ3161084

Jesper Lykke Jacobsen, Andrea Bedini

Publication date: 11 October 2010

Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1003.4847

zbMATH Keywords

transfer matrix; random graphs; Potts model; vertex colourings

Mathematics Subject Classification ID

05C80: Random graphs (graph-theoretic aspects)

82B20: Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics

05C15: Coloring of graphs and hypergraphs

Related Items

tutte