Improved bounds on the zeros of the chromatic polynomial of graphs and claw-free graphs
Abstract
We prove that for any graph G the (complex) zeros of its chromatic polynomial, G(x), lie inside the disk centered at 0 of radius 4.25 (G), where (G) denotes the maximum degree of G. This improves on a recent result of Jenssen, Patel and Regts, who proved a bound of 5.94(G). Moreover, we show that for graphs of sufficiently large girth we can replace 4.25 by 3.60 and for claw-free graphs we can replace 4.25 by 3.81. Our proofs add some substantially novel ideas to those developed by Jenssen, Patel, and Regts, while building on them. A key novel ingredient for claw-free graphs is to use a representation of the coefficients of the chromatic polynomial in terms of the number of certain partial acyclic orientations.
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.