AbstractGeelen, 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
We prove that a binary matroid with huge branch-width contains the cycle matroid of a large grid as ...
We prove that a binary matroid with huge branch-width contains the cycle matroid of a large grid as ...
We prove that a binary matroid with huge branch-width contains the cycle matroid of a large grid as ...
AbstractRobertson and Seymour have shown that there is no infinite set of graphs in which no member ...
Geelen, Gerards, and Whittle have announced that there are no infinite sets of binary matroids none ...
Robertson and Seymour have shown that there is no infinite set of graphs in which no member is a min...
AbstractFor each prime p, we construct an infinite antichain of matroids in which each matroid has c...
AbstractGeelen, Gerards, and Whittle have announced that there are no infinite sets of binary matroi...
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...
For each prime p, we construct an infinite antichain of matroids in which each matroid has character...
AbstractFor each prime p, we construct an infinite antichain of matroids in which each matroid has c...
For all positive integers k, the class Bk of matroids of branch-width at most k is minor-closed. Whe...
AbstractWe prove that a binary matroid with huge branch-width contains the cycle matroid of a large ...
Abstract. We give an excluded-minor characterization for the class of matroids M in which M\e or M/e...
We prove that a binary matroid with huge branch-width contains the cycle matroid of a large grid as ...
We prove that a binary matroid with huge branch-width contains the cycle matroid of a large grid as ...
We prove that a binary matroid with huge branch-width contains the cycle matroid of a large grid as ...
AbstractRobertson and Seymour have shown that there is no infinite set of graphs in which no member ...
Geelen, Gerards, and Whittle have announced that there are no infinite sets of binary matroids none ...
Robertson and Seymour have shown that there is no infinite set of graphs in which no member is a min...
AbstractFor each prime p, we construct an infinite antichain of matroids in which each matroid has c...
AbstractGeelen, Gerards, and Whittle have announced that there are no infinite sets of binary matroi...
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...
For each prime p, we construct an infinite antichain of matroids in which each matroid has character...
AbstractFor each prime p, we construct an infinite antichain of matroids in which each matroid has c...
For all positive integers k, the class Bk of matroids of branch-width at most k is minor-closed. Whe...
AbstractWe prove that a binary matroid with huge branch-width contains the cycle matroid of a large ...
Abstract. We give an excluded-minor characterization for the class of matroids M in which M\e or M/e...
We prove that a binary matroid with huge branch-width contains the cycle matroid of a large grid as ...
We prove that a binary matroid with huge branch-width contains the cycle matroid of a large grid as ...
We prove that a binary matroid with huge branch-width contains the cycle matroid of a large grid as ...
DOI
Add to ORKG