The Structure of Chromatic Polynomials of Planar Triangulation Graphs and Implications for Chromatic Zeros and Asymptotic Limiting Quantities

preprint2012arXivOpen access

Abstract

We present an analysis of the structure and properties of chromatic polynomials P(Gpt,m⃗,q)P(G_{pt,\vec m},q) of one-parameter and multi-parameter families of planar triangulation graphs Gpt,m⃗G_{pt,\vec m}, where m⃗=(m1,...,mp){\vec m} = (m_1,...,m_p) is a vector of integer parameters. We use these to study the ratio of ∣P(Gpt,m⃗,τ+1)∣|P(G_{pt,\vec m},τ+1)| to the Tutte upper bound (τ−1)n−5(τ-1)^{n-5}, where τ=(1+5 )/2τ=(1+\sqrt{5} \ )/2 and nn is the number of vertices in Gpt,m⃗G_{pt,\vec m}. In particular, we calculate limiting values of this ratio as n→∞n \to \infty 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 Gpt,m⃗G_{pt,\vec m} with p=1p=1 and p=2p=2 and show that these have a structure of the form P(Gpt,m,q)=cGpt,1λ1m+cGpt,2λ2m+cGpt,3λ3mP(G_{pt,m},q) = c_{_{G_{pt}},1}λ_1^m + c_{_{G_{pt}},2}λ_2^m + c_{_{G_{pt}},3}λ_3^m for p=1p=1, where λ1=q−2λ_1=q-2, λ2=q−3λ_2=q-3, and λ3=−1λ_3=-1, and P(Gpt,m⃗,q)=∑i1=13∑i2=13cGpt,i1i2λi1m1λi2m2P(G_{pt,\vec m},q) = \sum_{i_1=1}^3 \sum_{i_2=1}^3 c_{_{G_{pt}},i_1 i_2} λ_{i_1}^{m_1}λ_{i_2}^{m_2} for p=2p=2. We derive properties of the coefficients cGpt,i⃗c_{_{G_{pt}},\vec i} and show that P(Gpt,m⃗,q)P(G_{pt,\vec m},q) has a real chromatic zero that approaches (1/2)(3+5 )(1/2)(3+\sqrt{5} \ ) as one or more of the mi→∞m_i \to \infty. The generalization to p≥3p \ge 3 is given. Further, we present a one-parameter family of planar triangulations with real zeros that approach 3 from below as m→∞m \to \infty. Implications for the ground-state entropy of the Potts antiferromagnet are discussed.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.