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

Abstract

We present an analysis of the structure and properties of chromatic polynomials P(Gpt, m,q) of one-parameter and multi-parameter families of planar triangulation graphs Gpt, m, where m = (m1,...,mp) is a vector of integer parameters. We use these to study the ratio of |P(Gpt, m,τ+1)| to the Tutte upper bound (τ-1)n-5, where τ=(1+5 \ )/2 and n is the number of vertices in Gpt, m. In particular, we calculate limiting values of this ratio as n ∞ 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 with p=1 and p=2 and show that these have a structure of the form P(Gpt,m,q) = c_Gpt,1λ1m + c_Gpt,2λ2m + c_Gpt,3λ3m for p=1, where λ1=q-2, λ2=q-3, and λ3=-1, and P(Gpt, m,q) = Σi1=13 Σi2=13 c_Gpt,i1 i2 λi1m1λi2m2 for p=2. We derive properties of the coefficients c_Gpt, i and show that P(Gpt, m,q) has a real chromatic zero that approaches (1/2)(3+5 \ ) as one or more of the mi ∞. The generalization to p 3 is given. Further, we present a one-parameter family of planar triangulations with real zeros that approach 3 from below as m ∞. Implications for the ground-state entropy of the Potts antiferromagnet are discussed.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…