Hostname: page-component-cd9895bd7-jkksz Total loading time: 0 Render date: 2024-12-23T14:02:01.179Z Has data issue: false hasContentIssue false
  • English
  • Français

A Zero-Free Interval for Chromatic Polynomials of Graphs

Published online by Cambridge University Press:  12 September 2008

Bill Jackson
Bill Jackson
Affiliation:
Department of Mathematical Studies, Goldsmiths' College, London SE14 6NW, England
Get access Rights & Permissions [Opens in a new window]

Abstract

Let G be a graph and P(G, t) be the chromatic polynomial of G. It is known that P(G, t) has no zeros in the intervals (−∞, 0) and (0, 1). We shall show that P(G, t) has no zeros in (1, 32/27]. In addition, we shall construct graphs whose chromatic polynomials have zeros arbitrarily close to 32/27.

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 2 , Issue 3 , September 1993 , pp. 325 - 336
Copyright
Copyright © Cambridge University Press 1993

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1]Birkhoff, G. D. and Lewis, D. C. (1946) Chromatic polynomials. Trans. Amer. Math. Soc. 60 355–451.CrossRefGoogle Scholar
[2]Tutte, W. T. (1966) Connectivity in Graphs, University of Toronto Press.CrossRefGoogle Scholar
[3]Tutte, W. T. (1974) Chromials. Springer Lecture Notes in Mathematics 411 243–266.CrossRefGoogle Scholar
[4]Woodall, D. R. (1977) Zeros of chromatic polynomials. In: Cameron, P. (ed.) Combinatorial Surveys, Proc. Sixth British Combinatorial Conference, Academic Press, London199–223.Google Scholar
[5]Woodall, D. R. (1992) A zero-free interval for chromatic polynomials. Discrete Math. 101 333–341.CrossRefGoogle Scholar