arXiv Analytics

Sign in

arXiv:1701.08049 [math.CO]AbstractReferencesReviewsResources

On a conjecture of Sokal concerning roots of the independence polynomial

Han Peter, Guus Regts

Published 2017-01-27Version 1

A conjecture of Sokal (2001) regarding the domain of non-vanishing for independence polynomials of graphs, states that given any natural number $\Delta \ge 3$, there exists a neighborhood in $\mathbb C$ of the interval $[0, \frac{(\Delta-1)^{\Delta-1}}{(\Delta-2)^{\Delta}})$ on which the independence polynomial of any graph with maximum degree at most $\Delta$ does not vanish. We show here that Sokal's Conjecture holds, as well as a multivariate version, and prove optimality for the domain of non-vanishing. An important step is to translate the setting to the language of complex dynamical systems.

Related articles: Most relevant | Search more
arXiv:2306.12934 [math.CO] (Published 2023-06-22)
On boundedness of zeros of the independence polynomial of tor
arXiv:1903.05462 [math.CO] (Published 2019-03-13)
On the location of roots of the independence polynomial of bounded degree graphs
arXiv:1710.03249 [math.CO] (Published 2017-10-09)
Optimal Graphs for Independence and $k$-Independence Polynomials