Add to ORKGGeelen, Gerards, and Whittle have announced that there are no infinite sets of binary matroids none of which is isomorphic to a minor of another. 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 antichain. © 2009 Elsevier Inc. All rights reserved
In unpublished work, Geelen proved that a matroid is near-regular if and only if it has no minor iso...
AbstractWe prove that a binary matroid with huge branch-width contains the cycle matroid of a large ...
AbstractIf E is a set of matroids, then EX(E) denotes the set of matroids that have no minor isomorp...
AbstractGeelen, Gerards, and Whittle have announced that there are no infinite sets of binary matroi...
AbstractGeelen, Gerards, and Whittle have announced that there are no infinite sets of binary matroi...
Robertson and Seymour have shown that there is no infinite set of graphs in which no member is a min...
AbstractRobertson and Seymour have shown that there is no infinite set of graphs in which no member ...
For each prime p, we construct an infinite antichain of matroids in which each matroid has character...
For each prime p, we construct an infinite antichain of matroids in which each matroid has characte...
AbstractFor each prime p, we construct an infinite antichain of matroids in which each matroid has c...
We show that the excluded minors for the class of matroids that are binary or ternary are U2,5, U3,5...
AbstractWe show that the excluded minors for the class of matroids that are binary or ternary are U2...
We show that the excluded minors for the class of matroids that are binary or ternary are U2,5, U3,5...
For all positive integers k, the class Bk of matroids of branch-width at most k is minor-closed. Whe...
AbstractIn unpublished work, Geelen proved that a matroid is near-regular if and only if it has no m...
In unpublished work, Geelen proved that a matroid is near-regular if and only if it has no minor iso...
AbstractWe prove that a binary matroid with huge branch-width contains the cycle matroid of a large ...
AbstractIf E is a set of matroids, then EX(E) denotes the set of matroids that have no minor isomorp...
AbstractGeelen, Gerards, and Whittle have announced that there are no infinite sets of binary matroi...
AbstractGeelen, Gerards, and Whittle have announced that there are no infinite sets of binary matroi...
Robertson and Seymour have shown that there is no infinite set of graphs in which no member is a min...
AbstractRobertson and Seymour have shown that there is no infinite set of graphs in which no member ...
For each prime p, we construct an infinite antichain of matroids in which each matroid has character...
For each prime p, we construct an infinite antichain of matroids in which each matroid has characte...
AbstractFor each prime p, we construct an infinite antichain of matroids in which each matroid has c...
We show that the excluded minors for the class of matroids that are binary or ternary are U2,5, U3,5...
AbstractWe show that the excluded minors for the class of matroids that are binary or ternary are U2...
We show that the excluded minors for the class of matroids that are binary or ternary are U2,5, U3,5...
For all positive integers k, the class Bk of matroids of branch-width at most k is minor-closed. Whe...
AbstractIn unpublished work, Geelen proved that a matroid is near-regular if and only if it has no m...
In unpublished work, Geelen proved that a matroid is near-regular if and only if it has no minor iso...
AbstractWe prove that a binary matroid with huge branch-width contains the cycle matroid of a large ...
AbstractIf E is a set of matroids, then EX(E) denotes the set of matroids that have no minor isomorp...