Binomial Inequalities for Chromatic, Flow, and Tension Polynomials

@article{Beck2021BinomialIF,
  title={Binomial Inequalities for Chromatic, Flow, and Tension Polynomials},
  author={Matthias Beck and Emerson Leon},
  journal={Discret. Comput. Geom.},
  year={2021},
  volume={66},
  pages={464-474}
}
  • M. Beck, E. Leon
  • Published 31 March 2018
  • Mathematics, Computer Science
  • Discret. Comput. Geom.
A famous and wide-open problem, going back to at least the early 1970’s, concerns the classification of chromatic polynomials of graphs. Toward this classification problem, one may ask for necessary inequalities among the coefficients of a chromatic polynomial, and we contribute such inequalities when a chromatic polynomial χG(n) = χ ∗ 0 ( n+d d ) + χ∗ 1 ( n+d−1 d ) + · · ·+ χ∗ d ( n d ) is written in terms of a binomial-coefficient basis. For example, we show that χj ≤ χ ∗ d− j , for 0 ≤ j ≤ d… 

References

SHOWING 1-10 OF 37 REFERENCES
h*-Vectors, Eulerian Polynomials and Stable Polytopes of Graphs
Conditions are given on a lattice polytope $P$ of dimension $m$ or its associated affine semigroup ring which imply inequalities for the $h^*$-vector $(h^*_0, h^*_1,\dots,h^*_m)$ of $P$ of the form
Ehrhart theory, modular flow reciprocity, and the Tutte polynomial
Given an oriented graph G, the modular flow polynomial $${\phi_G(k)}$$ counts the number of nowhere-zero $${\mathbb{Z}_k}$$-flows of G. We give a description of the modular flow polynomial in terms
Inequalities and Ehrhart $\delta$-Vectors
For any lattice polytope $P$, we consider an associated polynomial $\bar{\delta}_{P}(t)$ and describe its decomposition into a sum of two polynomials satisfying certain symmetry conditions. As a
Expansions of chromatic polynomials and log-concavity
In this paper we present several results and open problems about log-concavity properties of sequences associated with graph colorings. Five polynomials intimately related to the chromatic polynomial
Bounds on the coefficients of tension and flow polynomials
The goal of this article is to obtain bounds on the coefficients of modular and integral flow and tension polynomials of graphs. To this end we use the fact that these polynomials can be realized as
Graphical Eulerian numbers and chromatic generating functions
  • I. Tomescu
  • Computer Science, Mathematics
    Discret. Math.
  • 1987
Abstract In this paper some further properties of the coefficients of a chromatic generating function introduced by Linial are proved. A combinatorial interpretation of these numbers is given by
The chromatic generating function
Let G=(V E) be a graph of order n and Pg (x) its chromatic polynomial. It has been shown elsewhere that the chromatic generating function is rational and of the form In this note, we give an explicit
Sigma-polynomials and Graph Coloring
  • R. Korfhage
  • Computer Science, Mathematics
    J. Comb. Theory, Ser. B
  • 1978
Abstract A new class of graph polynomials is defined. Tight bounds on the coefficients of the polynomials are given, and the exact polynomials for several classes of graphs are derived. The
Acyclic orientations and chromatic generating functions
  • I. Gessel
  • Computer Science, Mathematics
    Discret. Math.
  • 2001
TLDR
It is shown that the coefficients of the polynomial (1−t) n−1 ∑ k=1 ∞ R(k)t k are nonnegative and the combinatorial interpretation of R( k) when k is a nonpositive integer is given.
Coloring complexes and arrangements
Abstract Steingrimsson’s coloring complex and Jonsson’s unipolar complex are interpreted in terms of hyperplane arrangements. This viewpoint leads to short proofs that all coloring complexes and a
...
1
2
3
4
...