Options
Two results on real zeros of chromatic polynomials
Citation
Dong, F. M., & Koh, K. M. (2004). Two results on real zeros of chromatic polynomials. Combinatorics, Probability and Computing, 13(6), 809-813. https://doi.org/10.1017/S0963548304006418
Abstract
This note presents two results on real zeros of chromatic polynomials. The first result states that if G is a graph containing a q-tree as a spanning subgraph, then the chromatic polynomial P(G, λ) of G has no non-integer zeros in the interval (0, q). Sokal conjectured that for any graph G and any real λ > Δ(G), P(G, λ) > 0. Our second result confirms that it is true if Δ(G) ≥ [n/3] − 1, where n is the order of G.
Date Issued
2004
Publisher
Cambridge University Press
Journal
Combinatorics, Probability and Computing