Abstract
The \(\sigma \)-polynomial is given by \(\sigma (G,x) = \sum _{i=\chi (G)}^{n} a_{i}(G)\, x^{i}\), where \(a_{i}(G)\) is the number of partitions of the vertices of G into i nonempty independent sets. These polynomials are closely related to chromatic polynomials, as the chromatic polynomial of G is given by \(\sum _{i=\chi (G)}^{n} a_{i}(G)\, x(x-1) \ldots (x-(i-1))\). It is known that the closure of the real roots of chromatic polynomials is precisely \(\{0,~1\} \bigcup [32/27,\infty )\), with \((-\infty ,0)\), (0, 1) and (1, 32 / 27) being maximal zero-free intervals for roots of chromatic polynomials. We ask here whether such maximal zero-free intervals exist for \(\sigma \)-polynomials, and show that the only such interval is \([0,\infty )\)—that is, the closure of the real roots of \(\sigma \)-polynomials is \((-\infty ,0]\).
Similar content being viewed by others
References
Beraha, S., Kahane, J., Weiss: Limits of zeros of recursively defined families of polynomials. In: Rota G.-C. (eds.) Studies in Foundations and Combinatorics, Vol. 1, Advances in Mathematics Supplementary Studies, pp. 213–232. Academic Press, New York (1978)
Brenti, F.: Expansions of chromatic polynomials and log-concavity. Trans. Am. Math. Soc. 332, 729–756 (1992)
Brenti, F., Royle, G.F., Wagner, D.G.: Location of zeroes of chromatic and related polynomials of graphs. Canad. J. Math. 46, 55–80 (1994)
Dong, F.M., Koh, K.M., Teo, K.L.: Chromatic Polynomials And Chromaticity Of Graphs. World Scientific, London (2005)
Duncan, B., Peele, R.: Bell and Stirling Numbers for Graphs, J. Integer Seq. 12 (2009), article 09.7.1
Elbert, C.: Weak asymptotics for the generating polynomials of the Stirling numbers of the second kind. J. Approx. Theory 109, 218–228 (2001)
Galvin, D., Thanh, D.T.: Stirling numbers of forests and cycles. Electron. J. Combin. 20, P73 (2013)
Godsil, C.D.: Algebraic Combinatorics. Chapman and Hall Inc., New York (1993)
Harper, L.H.: Stirling behavior is asymptotically normal. Ann. Math. Stat. 38, 410–414 (1967)
Híc, P., Nedela, R.: Balanced integral trees. Math. Slovaca 48, 429–445 (1998)
Jackson, B.: A zero-free interval for chromatic polynomials of graphs. Combin. Probab. Comput. 2, 325–336 (1993)
Korfhage, R.R.: \(\sigma \)-polynomials and graph coloring. J. Combin. Theory Ser. B 24, 137–153 (1978)
Lieb, E.H.: Concavity properties and a generating function for stirling numbers. J. Combin. Theory 5, 203–206 (1968)
Makowsky, J.A., Ravve, E.V., Blanchard, N.K.: On the location of roots of graph polynomials. Eur. J. Combin. 41, 1–19 (2014)
Sokal, A.D.: Chromatic roots are dense in the whole complex plane. Combin. Probab. Comput. 13, 221–261 (2004)
Thomassen, C.: The zero-free intervals for chromatic polynomials of graphs. Combin. Prob. Comput. 6, 497–506 (1997)
Zhao, H.: Chromaticity and adjoint polynomials of graphs, Ph.D. Thesis, University of Twente (2005)
Acknowledgments
The first author would like to acknowledge the support of the Natural Sciences and Engineering Research Council of Canada (Grant number 170450–2013). Both authors would like to thank the referees for their helpful comments.
Author information
Authors and Affiliations
Corresponding author
Additional information
This research was partially supported by grants from NSERC.
Rights and permissions
About this article
Cite this article
Brown, J.I., Erey, A. On the Real Roots of \(\sigma \)-Polynomials. Graphs and Combinatorics 32, 1723–1730 (2016). https://doi.org/10.1007/s00373-016-1684-0
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-016-1684-0