This paper specifies all ternary paving matroids. A paving matroid is a matroid in which no circuit has size less than the rank of the matroid. The main result of this work is the Theorem 1.1. This contains the most difficult part of the characterization of ternary paving matroids. Theorem 1.1: The 3-connected ternary paving matroids are precisely the 3- connected minors of \(\text{PG}(2,3)\), S(5,6,12), \(R_ 8\) and \(T_ 8\), where \(R_ 8\) is the real affine cube and \(T_ 8\) is an other 8-element self-dual matroid. In Section 2, all paving matroids that are not 3-connected are determined and this information is used to specify all such ternary matroids. In Section 3, the author proves Theorem 1.1, in particular, constructs all 3-connected ternary paving matroids by building up, an element at a time, from a wheel or a whirl through a sequence of 3-connected ternary paving matroids.
- A characterization of the ternary matroids with no \(M(K_ 4)\)-minor
- A Combinatorial Model for Series-Parallel Networks
- Decomposition of regular matroids
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- scientific article; zbMATH DE number 3608715 (Why is no real title available?)
- Matroid representation over GF(3)
- On binary paving matroids
- On Reid's characterization of the ternary matroids
- On ternary transversal matroids
- On ternary transversal matroids
- A characterization of the orientations of ternary matroids
- On binary \(k\)-paving matroids and Reed-Muller codes
- On paving matroids and a generalization of MDS codes
- Hypergraph characterization of split matroids
- On self-correcting logic circuits of unreliable gates with at most two inputs
- Matroids are not Ehrhart positive
- A characterization of tangle matroids
- scientific article; zbMATH DE number 3863215 (Why is no real title available?)
- Trilateral matroids induced by n₃-configurations
- Some properties of automorphism groups of paving matroids
- A note on connectivity preserving splitting operation for matroids representable over GF(p)
- k-loose elements and k-paving matroids
- Characterizations of ternary matroids in terms of circuit signatures
This page was built for publication: Ternary paving matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1179280)
