Article ID Journal Published Year Pages File Type
4648241 Discrete Mathematics 2012 7 Pages PDF
Abstract

We give an upper bound and a class of lower bounds on the coefficients of the characteristic polynomial of a simple binary matroid. This generalizes the corresponding bounds for graphic matroids of Li and Tian (1978) [3], as well as a matroid lower bound of Björner (1980) [1] for simple binary matroids. As the flow polynomial of a graph GG is the characteristic polynomial of the dual matroid M∗(G)M∗(G), the bound applies to flow polynomials.

Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Authors
, ,