We show that, for every integer n greater than two, there is a number N such that every 3-connected binary matroid with at least N elements has a minor that is isomorphic to the cycle matroid of K3,n, its dual, the cycle matroid of the wheel with n spokes, or the vector matroid of the binary matrix (In|Jn-In), where Jn is the n × n matrix of all ones. © 1996 Academic Press, Inc
AbstractA result of Ding, Oporowski, Oxley, and Vertigan reveals that a large 3-connected matroid M ...
In this dissertation, we begin with an introduction to a matroid as the natural generalization of in...
It was proved by Oxley that U2,4 is the only non-trivial 3-connected matroid N such that, whenever a...
AbstractWe show that, for every integerngreater than two, there is a numberNsuch that every 3-connec...
This paper proves that, for every integernexceeding two, there is a numberN(n) such that every 3-con...
Let M be a 3-connected binary matroid and let n be an integer exceeding 2. Ding, Oporowski, Oxley, a...
AbstractLet M be a 3-connected binary matroid and let n be an integer exceeding 2. Ding, Oporowski, ...
Let M be a 3-connected binary matroid and let n be an integer exceeding two. Ding, Oporowski, Oxley,...
Abstract. A result of Ding, Oporowski, Oxley, and Vertigan reveals that a large 3-connected matroid ...
We show that for every n ≥ 3 there is some number m such that every 4-connected binary matroid with ...
We show that for every n ≥ 3 there is some number m such that every 4-connected binary matroid with ...
We show that for every n ≥ 3 there is some number m such that every 4-connected binary matroid with ...
We show that for every n ≥ 3 there is some number m such that every 4-connected binary matroid with ...
A result of Ding, Oporowski, Oxley, and Vertigan reveals that a large 3-connected matroid M has unav...
AbstractWe prove that, for each positive integer k, every sufficiently large 3-connected regular mat...
AbstractA result of Ding, Oporowski, Oxley, and Vertigan reveals that a large 3-connected matroid M ...
In this dissertation, we begin with an introduction to a matroid as the natural generalization of in...
It was proved by Oxley that U2,4 is the only non-trivial 3-connected matroid N such that, whenever a...
AbstractWe show that, for every integerngreater than two, there is a numberNsuch that every 3-connec...
This paper proves that, for every integernexceeding two, there is a numberN(n) such that every 3-con...
Let M be a 3-connected binary matroid and let n be an integer exceeding 2. Ding, Oporowski, Oxley, a...
AbstractLet M be a 3-connected binary matroid and let n be an integer exceeding 2. Ding, Oporowski, ...
Let M be a 3-connected binary matroid and let n be an integer exceeding two. Ding, Oporowski, Oxley,...
Abstract. A result of Ding, Oporowski, Oxley, and Vertigan reveals that a large 3-connected matroid ...
We show that for every n ≥ 3 there is some number m such that every 4-connected binary matroid with ...
We show that for every n ≥ 3 there is some number m such that every 4-connected binary matroid with ...
We show that for every n ≥ 3 there is some number m such that every 4-connected binary matroid with ...
We show that for every n ≥ 3 there is some number m such that every 4-connected binary matroid with ...
A result of Ding, Oporowski, Oxley, and Vertigan reveals that a large 3-connected matroid M has unav...
AbstractWe prove that, for each positive integer k, every sufficiently large 3-connected regular mat...
AbstractA result of Ding, Oporowski, Oxley, and Vertigan reveals that a large 3-connected matroid M ...
In this dissertation, we begin with an introduction to a matroid as the natural generalization of in...
It was proved by Oxley that U2,4 is the only non-trivial 3-connected matroid N such that, whenever a...