On the zero-free region for the chromatic polynomial of graphs with maximum degree and girth
arXiv:2409.13892
Abstract
The purpose of the present paper is to provide, for all pairs of integers with $\D\ge 3$ and , a positive number such that chromatic polynomial of a graph with maximum degree and finite girth is free of zero if . Our bounds enlarge the zero-free region in the complex plane of 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 .