pith. sign in

arxiv: 1701.08049 · v3 · pith:NQQ22LJ6new · submitted 2017-01-27 · 🧮 math.CO · cs.DS· math.DS

On a conjecture of Sokal concerning roots of the independence polynomial

classification 🧮 math.CO cs.DSmath.DS
keywords conjecturedeltaindependencesokaldelta-1domainnon-vanishingpolynomial
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.