On Reid's characterization of the ternary matroids
暂无分享,去创建一个
Abstract In this paper we prove a stronger version of a result of Ralph Reid characterizing the ternary matroids (i.e., the matroids representable over the field of 3 elements, GF(3)). In particular, we prove that a matroid is ternary if it has no seriesminor of type Ln for n ≥ 5 (n cells and n circuits, each of size n − 1), and no series-minor of type L 5 ∗ (dual of L5), BII (Fano matroid) or BI (dual of type BII). The proof we give does not assume Reid's theorem. Rather we give a direct proof based on the methods (notably the homotopy theorem) developed by Tutte for proving his characterization of regular matroids. Indeed, the steps involved in our proof closely parallel Tutte's proof, but carrying out these steps now becomes much more complicated.
[1] Tom Brylawski,et al. Modular constructions for combinatorial geometries , 1975 .
[2] R. Bixby,et al. A strengthened form of Tutte's characterization of regular matroids , 1976 .
[3] J. Edmonds. Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.
[4] W. T. Tutte. Lectures on matroids , 1965 .
[5] H. Whitney. On the Abstract Properties of Linear Dependence , 1935 .