AbstractWe introduce a new class of binary matroids called almost regular. Any such matroid is not regular, but for any element, at least one of the two minors produced by deletion and contraction of that element must be regular. Furthermore, certain labels are assigned to the elements, and these labels must obey several conditions. In this part we prove that the entire class of almost regular matroids is producible from just two matroids by repeated application of elementary operations, each of which is a series expansion, or a parallel addition, or a substitution of a triangle by a triad, or a substitution of a triad by a triangle. In Part VII it will be shown that this result leads to new and surprisingly simple constructions for several...
In unpublished work, Geelen proved that a matroid is near-regular if and only if it has no minor iso...
This paper is based on the element splitting operation for binary matroids that was introduced by Az...
It is easily proved that, if P is a class of graphs that is closed under induced subgraphs, then the...
AbstractLet P be a matrix property that is defined for the matrices over GF(2) or GF(3), and that is...
AbstractA new matroid decomposition with several attractive properties leads to a new theorem of alt...
AbstractTwo decomposition theorems of Part I are utilized to characterize minimal violation matroids...
AbstractA nongraphic matroid M is said to be almost-graphic if, for all elements e, either M\e or M/...
Seymour’s decomposition theorem [J. Combin. Theory Ser. B, 28 (1980), pp. 305– 359] for regular matr...
Abstract. We give an excluded-minor characterization for the class of matroids M in which M\e or M/e...
AbstractWe show that the excluded minors for the class of matroids that are binary or ternary are U2...
AbstractFor a matroid M, an element e such that both M∖e and M/e are regular is called a regular ele...
AbstractIt is proved that every regular matroid may be constructed by piecing together graphic and c...
We consider different ways of describing a matroid to a Turing machine by listing the members of var...
AbstractWe identify sufficient conditions under which a decomposable graph N induces a decomposition...
AbstractIt is a well-known result of Tutte, A homotopy theorem for matroids, I, II, Trans. Amer. Mat...
In unpublished work, Geelen proved that a matroid is near-regular if and only if it has no minor iso...
This paper is based on the element splitting operation for binary matroids that was introduced by Az...
It is easily proved that, if P is a class of graphs that is closed under induced subgraphs, then the...
AbstractLet P be a matrix property that is defined for the matrices over GF(2) or GF(3), and that is...
AbstractA new matroid decomposition with several attractive properties leads to a new theorem of alt...
AbstractTwo decomposition theorems of Part I are utilized to characterize minimal violation matroids...
AbstractA nongraphic matroid M is said to be almost-graphic if, for all elements e, either M\e or M/...
Seymour’s decomposition theorem [J. Combin. Theory Ser. B, 28 (1980), pp. 305– 359] for regular matr...
Abstract. We give an excluded-minor characterization for the class of matroids M in which M\e or M/e...
AbstractWe show that the excluded minors for the class of matroids that are binary or ternary are U2...
AbstractFor a matroid M, an element e such that both M∖e and M/e are regular is called a regular ele...
AbstractIt is proved that every regular matroid may be constructed by piecing together graphic and c...
We consider different ways of describing a matroid to a Turing machine by listing the members of var...
AbstractWe identify sufficient conditions under which a decomposable graph N induces a decomposition...
AbstractIt is a well-known result of Tutte, A homotopy theorem for matroids, I, II, Trans. Amer. Mat...
In unpublished work, Geelen proved that a matroid is near-regular if and only if it has no minor iso...
This paper is based on the element splitting operation for binary matroids that was introduced by Az...
It is easily proved that, if P is a class of graphs that is closed under induced subgraphs, then the...