Algebraic properties of chromatic roots (Q510333): Difference between revisions

Summary: A chromatic root is a root of the chromatic polynomial of a graph. Any chromatic root is an algebraic integer. Much is known about the location of chromatic roots in the real and complex numbers, but rather less about their properties as algebraic numbers. This question was the subject of a seminar at the Isaac Newton Institute in late 2008. The purpose of this paper is to report on the seminar and subsequent developments. We conjecture that, for every algebraic integer \(\alpha\), there is a natural number \(n\) such that \(\alpha+n\) is a chromatic root. This is proved for quadratic integers; an extension to cubic integers has been found by \textit{A. Bohn} [``Chromatic roots as algebraic integers'', in: Proceedings of the 24th international conference on formal power series and algebraic combinatorics, FPSAC 2012, Nagoya, Japan, July 30 -- August 3, 2012. Nancy: The Association. Discrete Mathematics \& Theoretical Computer Science (DMTCS). Discrete Mathematics and Theoretical Computer Science. Proceedings, 539--550 (2012), \url{https://dmtcs.episciences.org/3061}]. The idea is to consider certain special classes of graphs for which the chromatic polynomial is a product of linear factors and one ``interesting'' factor of larger degree. We also report computational results on the Galois groups of irreducible factors of the chromatic polynomial for some special graphs. Finally, extensions to the Tutte polynomial are mentioned briefly.