The Structure of Chromatic Polynomials of Planar Triangulation Graphs and Implications for Chromatic Zeros and Asymptotic Limiting Quantities
Robert Shrock, Yan Xu

TL;DR
This paper analyzes the structure of chromatic polynomials for families of planar triangulation graphs, revealing their asymptotic behavior, zeros, and implications for graph theory and statistical physics.
Contribution
It introduces a detailed structural form of chromatic polynomials for these graph families and studies their zeros and asymptotic ratios, extending understanding of graph coloring properties.
Findings
Chromatic polynomials have a specific exponential form for p=1 and p=2.
Real chromatic zeros approach (3+√5)/2 as parameters grow.
A family of graphs with zeros approaching 3 from below as size increases.
Abstract
We present an analysis of the structure and properties of chromatic polynomials of one-parameter and multi-parameter families of planar triangulation graphs , where is a vector of integer parameters. We use these to study the ratio of to the Tutte upper bound , where and is the number of vertices in . In particular, we calculate limiting values of this ratio as for various families of planar triangulations. We also use our calculations to study zeros of these chromatic polynomials. We study a large class of families with and and show that these have a structure of the form for , where…
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.
