On the zero-free region for the chromatic polynomial of graphs with maximum degree and girth g
Abstract
The purpose of the present paper is to provide, for all pairs of integers (,g) with 3 and g 3, a positive number C(, g) such that chromatic polynomial PG(q) of a graph G with maximum degree and finite girth g is free of zero if |q| C(, g). Our bounds enlarge the zero-free region in the complex plane of PG(q) in comparison to previous bounds. In particular, for small values of our estimates yield a sensible improvement on the bounds recently obtained by Jenssen, Patel and Regts in JPR, while they coincide with those of JPR when ∞.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.