English

Chromatic roots and minor-closed families of graphs

Combinatorics 2016-03-29 v1

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 GGG \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.

Keywords

Cite

@article{arxiv.1603.08255,
  title  = {Chromatic roots and minor-closed families of graphs},
  author = {Thomas Perrett},
  journal= {arXiv preprint arXiv:1603.08255},
  year   = {2016}
}

Comments

18 pages, 5 figures