Chromatic Polynomials for Families of Strip Graphs and their Asymptotic Limits
Martin Rocek, Robert Shrock, and Shan-Ho Tsai (Institute for, Theoretical Physics, State University of New York at Stony Brook)

TL;DR
This paper computes chromatic polynomials for strip graphs, analyzes their asymptotic limits, and explores the nonanalytic locus in the complex plane, providing insights into lattice properties and connections to the Potts model.
Contribution
It introduces a generating function method to determine chromatic polynomials and their asymptotic limits for strip graphs, linking combinatorics with statistical mechanics.
Findings
Exact locus of nonanalytic points ${\
} in the complex plane identified.
As strip width increases, the loci elongate and approach configurations resembling 2D lattices.
Abstract
We calculate the chromatic polynomials and, from these, the asymptotic limiting functions for families of -vertex graphs comprised of repeated subgraphs adjoined to an initial graph . These calculations of for infinitely long strips of varying widths yield important insights into properties of for two-dimensional lattices . In turn, these results connect with statistical mechanics, since is the ground state degeneracy of the -state Potts model on the lattice . For our calculations, we develop and use a generating function method, which enables us to determine both the chromatic polynomials of finite strip graphs and the resultant function in the limit . From this, we obtain the exact continuous locus of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
