In approaching a combinatorial problem, it is often desirable to be armed with a notion asserting that some objects are more highly structured than others. In particular, focusing on highly structured objects may avoid certain degeneracies and allow for the core of the problem to be addressed. In matroid theory, the principle notion fulfilling this role of “structure” is that of connectivity. This thesis proves a number of results furthering the knowledge of matroid connectivity and also introduces a new structural notion, that of generalised uniformity.

The first part of this thesis considers 3-connected matroids and the presence of elements which may be deleted or contracted without the introduction of any non-minimal 2-separations. Principally, a Wheels-and-Whirls Theorem and then a Splitter Theorem is established, guaranteeing the existence of such elements, provided certain well-behaved structures are not present.

The second part of this thesis generalises the notion of a uniform matroid by way of a 2-parameter property capturing “how uniform” a given matroid is. Initially, attention is focused on matroids representable over some field. In particular, a finiteness result is established and a specific class of binary matroids is completely determined. The concept of generalised uniformity is then considered more broadly by an analysis of its relevance to a number of established matroid notions and settings. Within that analysis, a number of equivalent characterisations of generalised uniformity are obtained.

Lastly, the third part of the thesis considers a highly structured class of matroids whose members are defined by the nature of their circuits. A characterisation is achieved for the regular members of this class and, in general, the infinitely many excluded series minors are determined.