Chromatic roots and minor-closed families of graphs

Thomas Perrett

doi:10.1137/15M1040785

Chromatic roots and minor-closed families of graphs

Thomas Perrett

Department of Applied Mathematics and Computer Science

Research output: Contribution to journal › Journal article › Research › peer-review

481 Downloads (Orbit)

Abstract

Given a minor-closed class of graphs G, what is the in mum of the non-trivial roots of the chromatic polynomial of G ε G? When G is the class of all graphs, the answer is known to be 32/27. We answer this question exactly for three minor-closed classes of graphs. Furthermore, we conjecture precisely when the value is larger than 32/27.

Original language	English
Journal	S I A M Journal on Discrete Mathematics
Volume	30
Issue number	3
Pages (from-to)	1883-1897
ISSN	0895-4801
DOIs	https://doi.org/10.1137/15M1040785
Publication status	Published - 2016

Access to Document

10.1137/15M1040785

Minorsv2Accepted author manuscript, 270 KB

OpenUrl availability

Full text

Cite this

@article{3b6cf9c2fe8a43ae957d9506290ec36a,

title = "Chromatic roots and minor-closed families of graphs",

abstract = "Given a minor-closed class of graphs G, what is the in mum of the non-trivial roots of the chromatic polynomial of G ε G? When G is the class of all graphs, the answer is known to be 32/27. We answer this question exactly for three minor-closed classes of graphs. Furthermore, we conjecture precisely when the value is larger than 32/27.",

author = "Thomas Perrett",

year = "2016",

doi = "10.1137/15M1040785",

language = "English",

volume = "30",

pages = "1883--1897",

journal = "S I A M Journal on Discrete Mathematics",

issn = "0895-4801",

publisher = "Society for Industrial and Applied Mathematics",

number = "3",

}

TY - JOUR

T1 - Chromatic roots and minor-closed families of graphs

AU - Perrett, Thomas

PY - 2016

Y1 - 2016

N2 - Given a minor-closed class of graphs G, what is the in mum of the non-trivial roots of the chromatic polynomial of G ε G? When G is the class of all graphs, the answer is known to be 32/27. We answer this question exactly for three minor-closed classes of graphs. Furthermore, we conjecture precisely when the value is larger than 32/27.

AB - Given a minor-closed class of graphs G, what is the in mum of the non-trivial roots of the chromatic polynomial of G ε G? When G is the class of all graphs, the answer is known to be 32/27. We answer this question exactly for three minor-closed classes of graphs. Furthermore, we conjecture precisely when the value is larger than 32/27.

U2 - 10.1137/15M1040785

DO - 10.1137/15M1040785

M3 - Journal article

SN - 0895-4801

VL - 30

SP - 1883

EP - 1897

JO - S I A M Journal on Discrete Mathematics

JF - S I A M Journal on Discrete Mathematics

IS - 3

ER -

Chromatic roots and minor-closed families of graphs

Abstract

Access to Document

OpenUrl availability

Fingerprint

Cite this