On partial sums of chromatic polynomials
Inequalities of the Bonferroni type are proved for \(P_{G}(\lambda)\), the chromatic polynomial of the graph \(G\). If \(P_{G}(\lambda)=\lambda ^n+a_1\lambda ^{n-1}+\cdots +a_n\) (\(n\) is the number of vertices of \(G\) and \(P_{G}(\lambda)\) is defined, of course, as the number of the proper vertex colorings of \(G\) by the colors \(\{1,2,\ldots ,\lambda \}\)) and \(\lambda \) is a positive integer, then \(P_{G}(\lambda)\leq \lambda ^n+a_1\lambda ^{n-1}+\cdots +a_q\lambda ^{n-q}\) for each even \(q\) such that \(0\leq q\leq n\). For odd \(q\) the opposite inequality holds.
- An inequality for chromatic polynomials
- A chromatic partition polynomial
- Bounds to the chromatic polynomial of a graph
- Divisibility of certain coefficients of the chromatic polynomials.
- A note on the shameful conjecture
- Stapledon decompositions and inequalities for coefficients of chromatic polynomials
- On the chromatic polynomial of a graph
- Binomial inequalities for chromatic, flow, and tension polynomials
- On chromatic and dichromatic sum equations
- Some inequalities on chromatic polynomials
- scientific article; zbMATH DE number 3849263 (Why is no real title available?)
- scientific article; zbMATH DE number 1512685 (Why is no real title available?)
- Lower bounds and upper bounds for chromatic polynomials
- scientific article; zbMATH DE number 2107574 (Why is no real title available?)
- scientific article; zbMATH DE number 7282748 (Why is no real title available?)
- On the absolute sum of chromatic polynomial coefficient of graphs
- A correlation inequality involving stable set and chromatic polynomials
This page was built for publication: On partial sums of chromatic polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2760992)
