Binomial inequalities for chromatic, flow, and tension polynomials
DOI10.1007/s00454-021-00314-3zbMath1470.05083arXiv1804.00208OpenAlexW3177169614MaRDI QIDQ2046434
Publication date: 18 August 2021
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1804.00208
classificationchromatic polynomialbinomial coefficientEhrhart polynomialflow polynomiallattice polytopeorder polynomialtension polynomialunimodular triangulationbinomial transform\(h^\ast\)-polynomial
Graph polynomials (05C31) Exact enumeration problems, generating functions (05A15) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Coloring of graphs and hypergraphs (05C15) Algebraic aspects of posets (06A11) Flows in graphs (05C21)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bounds on the coefficients of tension and flow polynomials
- Ehrhart theory, modular flow reciprocity, and the Tutte polynomial
- Ehrhart series and lattice triangulations
- Triangulations. Structures for algorithms and applications
- Lattice points in lattice polytopes
- Graph coloring and monotone functions on posets
- Two poset polytopes
- Graphical Eulerian numbers and chromatic generating functions
- Stapledon decompositions and inequalities for coefficients of chromatic polynomials
- Polynomials associated with nowhere-zero flows
- \(h^\ast\)-vectors, Eulerian polynomials and stable polytopes of graphs
- \(\sigma\)-polynomials and graph coloring
- Alcoved polytopes. I.
- Coloring complexes and arrangements
- Tension polynomials of graphs
- Inequalities and Ehrhart $\delta $-vectors
- The chromatic generating function
- Expansions of Chromatic Polynomials and Log-Concavity
- Decompositions of Rational Convex Polytopes
- Computing the Continuous Discretely
- Polynomials Associated with Finite Gell-Complexes
- Acyclic orientations and chromatic generating functions
