Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-17T10:43:22.317Z Has data issue: false hasContentIssue false

On 3-Connected Matroids

Published online by Cambridge University Press:  20 November 2018

James G. Oxley*
Affiliation:
Australian National University, Canberra, Australia
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

This paper extends several graph-theoretic results to matroids. The main result of Tutte's paper [10] which introduced the theory of n-connection for matroids was a generalization of an earlier result of his [9] for 3-connected graphs. The latter has since been strengthened by Halin [3] and in Section 3 of this paper we prove a matroid analogue of Halin's result. Tutte used his result for 3-connected graphs to deduce a recursive construction of all simple 3-connected graphs having at least four vertices. In Section 4 we generalize this by giving a recursive construction of all 3-connected matroids of rank at least three. Section 2 contains a generalization to minimally n-connected matroids of a result of Dirac [2] for minimally 2-connected graphs.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1981