On weak maps of ternary matroids
Let M and N be ternary matroids having the same rank and the same ground set, and assume that every independent set in N is also independent in M. The main result of this paper proves that if M is 3-connected and N is connected and non-binary, then M = N. A related result characterizes precisely when a matroid that is obtained by relaxing a circuit-hyperplane of a ternary matroid is also ternary. © 1998 Academic Press Limited.
Publication Source (Journal or Book title)
European Journal of Combinatorics
Oxley, J., & Whittle, G. (1998). On weak maps of ternary matroids. European Journal of Combinatorics, 19 (3), 377-389. https://doi.org/10.1006/eujc.1997.0180