Learn More
A parallel minor is obtained from a graph by any sequence of edge contractions and parallel edge deletions. We prove that, for any positive integer k, every internally 4-connected graph of sufficiently high order contains a parallel minor isomorphic to a variation of K 4,k with a complete graph on the vertices of degree k, the k-partition triple fan with a(More)
Let M be a matroid. When M is 3-connected, Tutte's Wheels-and-Whirls Theorem proves that M has a 3-connected proper minor N with |E(M) − E(N)| = 1 unless M is a wheel or a whirl. This paper establishes a corresponding result for internally 4-connected binary matroids. In particular, we prove that if M is such a matroid, then M has an internally 4-connected(More)
In our quest to find a splitter theorem for internally 4-connected binary matroids, we proved in the preceding paper in this series that, except when M or its dual is a cubic Möbius or planar ladder or a certain coextension thereof, an internally 4-connected binary matroid M with an internally 4-connected proper minor N either has a proper internally(More)
A graph G is loosely-c-connected, or ℓ-c-connected, if there exists a number d depending on G such that the deletion of fewer than c vertices from G leaves precisely one infinite component and a graph containing at most d vertices. In this paper, we give the structure of a set of ℓ-c-connected infinite graphs that form an unavoidable set among the(More)
If S is a set of matroids, then the matroid M is S-fragile if, for every element e ∈ E(M), either M \e or M/e has no minor isomorphic to a member of S. Excluded-minor characterizations often depend, implicitly or explicitly, on understanding classes of fragile matroids. In certain cases, when M is a minor-closed class of S-fragile matroids, and N ∈ M, the(More)