Chromatic roots at 2 and at the Beraha number B10

Abstract

By the construction of suitable graphs and the determination of their chromatic polynomials, we resolve two open questions concerning real chromatic roots. First we exhibit graphs for which the Beraha number B10 = (5 + 5)/2 is a chromatic root. As it was previously known that no other non-integer Beraha number is a chromatic root, this completes the determination of precisely which Beraha numbers can be chromatic roots. Next we construct an infinite family of 3-connected graphs such that for any k ≥slant 1, there is a member of the family with q=2 as a chromatic root of multiplicity at least k. The former resolves a question of Salas and Sokal [J. Statist. Pys. 104 (2001) pp. 609--699] and the latter a question of Dong and Koh [J. Graph Theory 70 (2012) pp. 262--283].

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…