Title

The Smallest Rounded Sets of Binary Matroids

Document Type

Article

Publication Date

1-1-1990

Abstract

It was proved by Oxley that U2,4 is the only non-trivial 3-connected matroid N such that, whenever a 3-connected matroid M has an N-minor and x and y are elements of M, there is an N-minor of M using {x, y} . This paper establishes the corresponding result for binary matroids by proving that if M and N above must both be binary, then there are exactly two possibilities for N: the rank-three and rank-four wheels. © 1990, Academic Press Limited. All rights reserved.

Publication Source (Journal or Book title)

European Journal of Combinatorics

First Page

47

Last Page

56

This document is currently not available here.

Share

COinS