5 research outputs found
Improved bounds for the zeros of the chromatic polynomial via Whitney's Broken Circuit Theorem
We prove that for any graph of maximum degree at most , the zeros
of its chromatic polynomial (in ) lie inside the disc
of radius centered at . This improves on the previously best
known bound of approximately .
We also obtain improved bounds for graphs of high girth. We prove that for
every there is a constant such that for any graph of maximum
degree at most and girth at least , the zeros of its chromatic
polynomial lie inside the disc of radius centered at
, where is the solution to a certain optimization problem. In
particular, when and when and
tends to approximately as .
Key to the proof is a classical theorem of Whitney which allows us to relate
the chromatic polynomial of a graph to the generating function of so-called
broken-circuit-free forests in . We also establish a zero-free disc for the
generating function of all forests in (aka the partition function of the
arboreal gas) which may be of independent interest.Comment: 16 page
Approximate counting using Taylor’s theorem:a survey
In this article we consider certain well-known polynomials associated with graphs including the independence polynomial and the chromatic polynomial. These polynomials count certain objects in graphs: independent sets in the case of the independence polynomial and proper colourings in the case of the chro- matic polynomial. They also have interpretations as partition functions in statistical physics.The algorithmic problem of (approximately) computing these types of polyno- mials has been studied for close to 50 years, especially using Markov chain tech- niques. Around eight years ago, Barvinok devised a new algorithmic approach based on Taylor’s theorem for computing the permanent of certain matrices, and the approach has been applied to various graph polynomials since then. This arti- cle is intended as a gentle introduction to the approach as well as a partial survey of associated techniques and results
Bounds for the real zeros of chromatic polynomials
10.1017/S0963548308009449Combinatorics Probability and Computing176749-75