research

Chromatic roots and minor-closed families of graphs

Abstract

Given a minor-closed class of graphs G\mathcal{G}, what is the infimum of the non-trivial roots of the chromatic polynomial of G∈GG \in \mathcal{G}? When G\mathcal{G} is the class of all graphs, the answer is known to be 32/2732/27. We answer this question exactly for three minor-closed classes of graphs. Furthermore, we conjecture precisely when the value is larger than 32/2732/27.Comment: 18 pages, 5 figure

    Similar works