On a conjecture concerning the property of chromatic polynomials with negative variables
Abstract
Let G be a graph of order n and P(G,x) be the chromatic polynomial of G. Dong, Ge, Gong, Ning, Ouyang, and Tay (J. Graph Theory 96(2021) 343) conjectured that dkdxk ( [(-1)n P(G, x)] ) < 0 holds for all k ≥ 2 and x ∈ (-∞, 0). We prove this conjecture for all k ≥ 2 and x≤ -6.66 k , in which is the maximum degree of G.
0
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.