#### Filter Results:

#### Publication Year

2009

2017

#### Co-author

#### Key Phrase

#### Publication Venue

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)

To the memory of Tom Brylawski, who contributed so much to matroid theory. Abstract. We prove that, for each positive integer k, every sufficiently large 3-connected regular matroid has a parallel minor isomorphic to M * (K 3,k), M (W k), M (K k), the cycle matroid of the graph obtained from K 2,k by adding paths through the vertices of each vertex class,… (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)

We develop some basic tools to work with representable matroids of bounded tree-width and use them to prove that, for any prime power q and constant k, the characteristic polynomial of any loopless, GF (q)-representable matroid with tree-width k has no real zero greater than q k−1 .

A sufficiently large connected matroid M contains a big circuit or a big cocircuit. Pou-Lin Wu showed that we can ensure that M has a big circuit or a big cocircuit containing any chosen element of M. In this paper, we begin with a fixed connected matroid N and we take M to be a connected matroid that has N as a minor. Our main result establishes that if M… (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)