For claw-free graphs, the independence polynomial is proven zero-free in a disk of radius at least 1/(2Delta+1), beating Shearer's radius for degree at least 4, and a new signed forest-sum identity for the polynomial is established.
On the zero-free region for the chromatic polynomial of graphs with maximum degree $\Delta$ and girth $g$
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
The purpose of the present paper is to provide, for all pairs of integers $(\Delta,g)$ with $\D\ge 3$ and $g\ge 3$, a positive number $C(\Delta, g)$ such that chromatic polynomial $P_G(q)$ of a graph $G$ with maximum degree $\Delta$ and finite girth $g$ is free of zero if $|q|\ge C(\Delta, g)$. Our bounds enlarge the zero-free region in the complex plane of $P_G(q)$ in comparison to previous bounds. In particular, for small values of $\D$ our estimates yield a sensible improvement on the bounds recently obtained by Jenssen, Patel and Regts in \cite{JPR}, while they coincide with those of \cite{JPR} when $\Delta\to \infty$.
citation-role summary
citation-polarity summary
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
On the independent set polynomial of graphs and claw-free graphs
For claw-free graphs, the independence polynomial is proven zero-free in a disk of radius at least 1/(2Delta+1), beating Shearer's radius for degree at least 4, and a new signed forest-sum identity for the polynomial is established.