679 research outputs found
A class of non-binary matroids with many binary minors
It is a well-known result of Tutte, A homotopy theorem for matroids, I, II, Trans. Amer. Math. Soc. 88 (1958) 144-174. that U2,4 is the only non-binary matroid M such that, for every element e, both M\e and M/e are binary. Oxley generalized this result by characterizing the non-binary matroids M such that, for every element e of M, the deletion M\e or the contraction M/e is binary. We characterize those non-binary matroids M such that, for all elements e and f, at least two of M\e, f; M\e/f; M/e\f; and M/e, f are binary. Β© 1999 Elsevier Science B.V. All rights reserved
On two classes of nearly binary matroids
We give an excluded-minor characterization for the class of matroids M in
which M\e or M/e is binary for all e in E(M). This class is closely related to
the class of matroids in which every member is binary or can be obtained from a
binary matroid by relaxing a circuit-hyperplane. We also provide an
excluded-minor characterization for the second class.Comment: 14 pages, 4 figures. This paper has been accepted for publication in
the European Journal of Combinatorics. This is the final version of the pape
Splitters and Decomposers for Binary Matroids
Let denote the class of binary matroids with no minors
isomorphic to . In this paper we give a decomposition theorem
for , where is a certain 10-element rank-4
matroid. As corollaries we obtain decomposition theorems for the classes
obtained by excluding the Kuratowski graphs and . These decomposition
theorems imply results on internally -connected matroids by Zhou
[\ref{Zhou2004}], Qin and Zhou [\ref{Qin2004}], and Mayhew, Royle and Whitte
[\ref{Mayhewsubmitted}].Comment: arXiv admin note: text overlap with arXiv:1403.775
Excluding Kuratowski graphs and their duals from binary matroids
We consider some applications of our characterisation of the internally
4-connected binary matroids with no M(K3,3)-minor. We characterise the
internally 4-connected binary matroids with no minor in some subset of
{M(K3,3),M*(K3,3),M(K5),M*(K5)} that contains either M(K3,3) or M*(K3,3). We
also describe a practical algorithm for testing whether a binary matroid has a
minor in the subset. In addition we characterise the growth-rate of binary
matroids with no M(K3,3)-minor, and we show that a binary matroid with no
M(K3,3)-minor has critical exponent over GF(2) at most equal to four.Comment: Some small change
- β¦