Article ID Journal Published Year Pages File Type
4653177 European Journal of Combinatorics 2017 11 Pages PDF
Abstract
We develop some basic tools to work with representable matroids of bounded tree-width and use them to prove that, for any prime power q and constant k, the characteristic polynomial of any loopless, GF(q)-representable matroid with tree-width k has no real zero greater than qk−1.
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Authors
, , , ,