Title

On the 3-connected matroids that are minimal having a fixed restriction

Document Type

Article

Publication Date

1-1-2000

Abstract

Let N be a restriction of a 3-connected matroid M and let M′ be a 3-connected minor of M that is minimal having N as a restriction. This paper gives a best-possible upper bound on \E(M′)- E(N)\. © Springer-Verlag 2000.

Publication Source (Journal or Book title)

Graphs and Combinatorics

First Page

285

Last Page

318

This document is currently not available here.

Share

COinS