Our main result will determine precisely when a class of such matroids contains an infinite antichain. The terminology used here for graphs and matroids will ...

In this paper, we examine a class of matroids of relatively simple structure: M a,b,c consists of those matroids for which the deletion of some set of at most a ...

Matroids on convex geometries (cg-matroids). We consider matroidal structures on convex geometries, which we call cg-matroids. · How To Split Antichains In ...

For each prime p, Reid [10] conjectured that every matroid that has characteristic set {p} and is an excluded minor for Q–representability has at most 2p+2 ...

For each prime p, we construct an infinite antichain of matroids in which each matroid has characteristic set fpg. For p = 2, each of the matroids in our ...

Jan 6, 2002 · For each prime p , we construct an infinite antichain of matroids in which each matroid has characteristic set {p} .

In this paper, we use this result to determine precisely when a minor-closed class of matroids with a single excluded minor does not contain such an infinite ...

For each prime p, we construct an infinite antichain of matroids in which each matroid has characteristic set {p}. For p=2, each of the matroids in our ...

We consider matroidal structures on convex geometries, which we call cg-matroids. The concept of a cg-matroid is closely related to but different from that ...

Geelen, Gerards, and Whittle have announced that there are no infinite sets of binary matroids none of which is isomorphic to a minor of another.