Document Type
Article
Publication Date
5-6-2000
Abstract
Let N be a minor of a 3-connected matroid M and let M′ be a 3-connected minor of M that is minimal having N as a minor. This paper commences the study of the problem of finding a best-possible upper bound on |E(M′) - E(N)|. The main result solves this problem in the case that N and M have the same rank. © 2000 Elsevier Science B.V. All rights reserved.
Publication Source (Journal or Book title)
Discrete Mathematics
First Page
131
Last Page
165
Recommended Citation
Lemos, M., & Oxley, J. (2000). On the 3-connected matroids that are minimal having a fixed spanning restriction. Discrete Mathematics, 218 (1-3), 131-165. https://doi.org/10.1016/S0012-365X(99)00344-1
COinS
