On derivatives and higher-order derivatives of chromatic polynomials
Combinatorics
2026-04-21 v2
Abstract
Let be a graph of order with maximum degree , and let denote its chromatic polynomial. We investigate several properties of related to its derivatives and higher-order derivatives. First, we study the monotonicity of . Dong proved that for all real . In particular, taking establishes the Bartels-Welsh ``shameful conjecture" that . Fadnavis later showed that the same inequality holds for all real . We improve this bound by proving that it also holds for all real . We then consider a conjecture of Dong, Ge, Gong, Ning, Ouyang, and Tay asserting that for all and . We establish this conjecture for all and .
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