English

On derivatives and higher-order derivatives of chromatic polynomials

Combinatorics 2026-04-21 v2

Abstract

Let G G be a graph of order n n with maximum degree Δ\Delta, and let P(G,x)P(G,x) denote its chromatic polynomial. We investigate several properties of P(G,x)P(G,x) related to its derivatives and higher-order derivatives. First, we study the monotonicity of P(G,x)/xnP(G,x)/x^n. Dong proved that (x1)nP(G,x)xnP(G,x1)(x-1)^nP(G,x)\geq x^nP(G,x-1) for all real xnx\geq n. In particular, taking x=nx=n establishes the Bartels-Welsh ``shameful conjecture" that P(G,n)/P(G,n1)>eP(G,n)/P(G,n-1)>e. Fadnavis later showed that the same inequality holds for all real x36Δ3/2x\geq 36\Delta^{3/2}. We improve this bound by proving that it also holds for all real x10Δ3/2x\geq 10\Delta^{3/2}. We then consider a conjecture of Dong, Ge, Gong, Ning, Ouyang, and Tay asserting that dkdxk(ln[(1)nP(G,x)])<0 \frac{d^k}{dx^k} \bigl( \ln[(-1)^n P(G, x)] \bigr) < 0 for all k2 k \geq 2 and x(,0) x \in (-\infty, 0) . We establish this conjecture for all k2 k \geq 2 and x3.01Δk x\leq -3.01\Delta k .

Keywords

Cite

@article{arxiv.2604.13221,
  title  = {On derivatives and higher-order derivatives of chromatic polynomials},
  author = {Bo Ning and Yan Yang},
  journal= {arXiv preprint arXiv:2604.13221},
  year   = {2026}
}

Comments

14 pages; this paper covered the results of arXiv:2603.07510, which is unpublished now