Exposing 3-separations in 3-connected matroids.
Let 𝑀 be a 3-connected matroid other than a wheel or a whirl. In the next paper in this series, we prove that there is an element whose deletion from 𝑀 or 𝑀∗ is 3-connected and whose only 3- separations are equivalent to those induced by 𝑀. The strategy used to prove this theorem involves showing that we can remove some element from a leaf of the tree of 3-separations of 𝑀. The main result of this paper is designed to allow us to do this.
SubjectsField of Research::01 - Mathematical Sciences
- Engineering: Reports