The Potts model and chromatic functions of graphs
From MaRDI portal
Publication:2444869
DOI10.4171/AIHPD/2zbMath1285.05094arXiv1311.4348MaRDI QIDQ2444869
Martin Klazar, Iain Moffatt, Martin Loebl
Publication date: 11 April 2014
Published in: Annales de l'Institut Henri Poincaré D. Combinatorics, Physics and their Interactions (AIHPD) (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1311.4348
graph coloring; Potts model; chromatic polynomial; integer partition; graph polynomial; \(U\)-polynomial
05C31: Graph polynomials
05A17: Combinatorial aspects of partitions of integers
82B20: Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics
05C15: Coloring of graphs and hypergraphs
Related Items
Resolving Stanley's \(e\)-positivity of claw-contractible-free graphs, Modular relations of the Tutte symmetric function, Isomorphism of weighted trees and Stanley's isomorphism conjecture for caterpillars, A vertex-weighted Tutte symmetric function, and constructing graphs with equal chromatic symmetric function
Cites Work
- The Tutte-Potts connection in the presence of an external magnetic field
- Chromatic polynomial, \(q\)-binomial counting and colored Jones function
- Intersection theory for graphs
- The polychromate and a chord diagram polynomial
- Graph colorings and related symmetric functions: ideas and applications: A description of results, interesting applications, and notable open problems.
- A symmetric function generalization of the chromatic polynomial of a graph
- On the Potts model partition function in an external field
- Bounds on the Complex Zeros of (Di)Chromatic Polynomials and Potts-Model Partition Functions
- AN OVERVIEW OF Λ-TYPE OPERATIONS ON QUASI-SYMMETRIC FUNCTIONS