On the Roots of σ‐Polynomials

Brown, Jason I.; Erey, Aysel

doi:10.1002/jgt.21889

Search citation statements

Order By: Relevance

Paper Sections

Select...

Bounding the Real Part Of Complex Chromatic Roots By N −1

Citation Types

Supporting

Mentioning

Contrasting

Publication Types

Select...

Article1

Relationship

Self Cite1

Independent0

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Lemma 2.7. [3,10] Let π(G, x) = a i (x) ↓i , then a n−i counts the number of subgraphs of the form · ∪ k j=1 K m j +1 in G where k j=1 m j = i and m j ∈ Z + .…”

Section: Bounding the Real Part Of Complex Chromatic Roots By N −mentioning

confidence: 99%

A note on the real part of complex chromatic roots

Brown

Erey

2014

Discrete Mathematics

Self Cite

View full text Add to dashboard Cite

A chromatic root is a root of the chromatic polynomial of a graph. While the real chromatic roots have been extensively studied and well understood, little is known about the real parts of chromatic roots. It is not difficult to see that the largest real chromatic root of a graph with n vertices is n − 1, and indeed, it is known that the largest real chromatic root of a graph is at most the tree-width of the graph. Analogous to these facts, it was conjectured in [8] that the real parts of chromatic roots are also bounded above by both n − 1 and the tree-width of the graph.In this article we show that for all k ≥ 2 there exist infinitely many graphs G with tree-width k such that G has non-real chromatic roots z with (z) > k. We also discuss the weaker conjecture and prove it for graphs G with χ(G) ≥ n − 3.

show abstract

“…Lemma 2.7. [3,10] Let π(G, x) = a i (x) ↓i , then a n−i counts the number of subgraphs of the form · ∪ k j=1 K m j +1 in G where k j=1 m j = i and m j ∈ Z + .…”

Section: Bounding the Real Part Of Complex Chromatic Roots By N −mentioning

confidence: 99%