Theory of linear and integer programming
Theory of linear and integer programming
A monotonicity property of h-vectors and h*-vectors
European Journal of Combinatorics - Special issue dedicated to Bernt Lindstro¨m
Polynomials associated with nowhere-zero flows
Journal of Combinatorial Theory Series B
The Coloring Ideal and Coloring Complex of a Graph
Journal of Algebraic Combinatorics: An International Journal
The Topology of the Coloring Complex
Journal of Algebraic Combinatorics: An International Journal
g-Elements, finite buildings and higher Cohen-Macaulay connectivity
Journal of Combinatorial Theory Series A
h-Vectors of Gorenstein polytopes
Journal of Combinatorial Theory Series A
Link complexes of subspace arrangements
European Journal of Combinatorics
The number of nowhere-zero flows on graphs and signed graphs
Journal of Combinatorial Theory Series B
Coloring complexes and arrangements
Journal of Algebraic Combinatorics: An International Journal
Quadratic Gröbner bases for smooth 3×3 transportation polytopes
Journal of Algebraic Combinatorics: An International Journal
Enumerating colorings, tensions and flows in cell complexes
Journal of Combinatorial Theory Series A
Hi-index | 0.00 |
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 Ehrhart polynomials of inside-out polytopes. Inside-out polytopes come with an associated relative polytopal complex and, for a wide class of inside-out polytopes, we show that this complex has a convex ear decomposition. This leads to the desired bounds on the coefficients of these polynomials.