Pith. sign in

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.

1 Pith paper citing it
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

background 1

citation-polarity summary

fields

math.CO 1

years

2025 1

verdicts

CONDITIONAL 1

roles

background 1

polarities

unclear 1

representative citing papers

On the independent set polynomial of graphs and claw-free graphs

math.CO · 2025-05-28 · conditional · novelty 5.0

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.

citing papers explorer

Showing 1 of 1 citing paper.

  • On the independent set polynomial of graphs and claw-free graphs math.CO · 2025-05-28 · conditional · none · ref 20 · internal anchor

    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.