Document Type
Article
Publication Date
1-1-1984
Abstract
By a well-known result of Tutte, if e is an element of a connected matroid M, then either the deletion or the contraction of e from M is connected. If, for every element of M, exactly one of these minors is connected, then we call M minor-minimally-connected. This paper characterizes such matroids and shows that they must contain a number of two-element circuits or cocircuits. In addition, a new bound is proved on the number of 2-cocircuits in a minimally connected matroid. © 1984.
Publication Source (Journal or Book title)
Discrete Mathematics
First Page
63
Last Page
72
Recommended Citation
Oxley, J. (1984). On minor-minimally-connected matroids. Discrete Mathematics, 51 (1), 63-72. https://doi.org/10.1016/0012-365X(84)90024-4
COinS