arXiv:1611.09728 [math.CO]AbstractReferencesReviewsResources
Stapledon Decompositions and Inequalities for Coefficients of Chromatic Polynomials
Published 2016-11-29Version 1
We use a polynomial decomposition result by Stapledon to show that the numerator polynomial of the Ehrhart series of an open polytope is the difference of two symmetric polynomials with nonnegative integer coefficients. We obtain a related decomposition for order polytopes and for the numerator polynomial of the corresponding series for chromatic polynomials. The nonnegativity of the coefficients in such decompositions provide inequalities satisfied by the coefficients of chromatic polynomials for any simple graph.
Categories: math.CO
Related articles: Most relevant | Search more
Chromatic polynomials of complementary (n,k)-clique pairs
arXiv:2007.05217 [math.CO] (Published 2020-07-10)
Polynomials related to chromatic polynomials
arXiv:1103.6206 [math.CO] (Published 2011-03-31)
Automatic Generation of Generating Functions for Chromatic Polynomials for Grid Graphs (and more general creatures) of Fixed (but arbitrary!) Width