In this paper, we prove that any simple and cosimple connected binary matroid has at least four connected hyperplanes. We further prove that each element in such a matroid is contained in at least two connected hyperplanes. Our main result generalizes a matroid result of Kelmans, and independently,
Connected hyperplanes in binary matroids
โ Scribed by Manoel Lemos; T.R.B. Melo
- Publisher
- Elsevier Science
- Year
- 2010
- Tongue
- English
- Weight
- 259 KB
- Volume
- 432
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
In this paper, it is shown that, for a minor-closed class ~ of matroids, the class of matroids in which every hyperplane is in Jยข' is itself minor-closed and has, as its excluded minors, the matroids U1,1 @ N such that N is an excluded minor for ,g. This result is applied to the class of matroids of
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 K 3, n , its dual, the cycle matroid of the wheel with n spokes, or the vector matroid of the binary matr
In this paper, we shall consider the following problem: up to duality, is a connected matroid reconstructible from its connectivity function? Cunningham conjectured that this question has an affirmative answer, but Seymour gave a counter-example for it. In the same paper, Seymour proved that a conne
We introduce a splitting operation for binary matroids which is a natural generalization of the splitting operation for graphs and investigate some of its basic properties. Eulerian binary matroids are characterized in terms of the splitting operation.