Bounding the coefficients of the characteristic polynomials of simple binary matroids

  • Delaplane L
  • Wu H
  • 4


    Mendeley users who have this article in their library.
  • 0


    Citations of this article.


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 Bjrner (1980) [1] for simple binary matroids. As the flow polynomial of a graph G is the characteristic polynomial of the dual matroid M*(G), the bound applies to flow polynomials. © 2012 Elsevier B.V. All rights reserved.

Author-supplied keywords

  • Binary matroids
  • Characteristic polynomials of binary matroids
  • Chromatic polynomials of graphs
  • Coefficients
  • Flow polynomials of graphs

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Loni Delaplane

  • Haidong Wu

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free