Abstract
A simple binary matroid is called -free if none of its rank-4 flats are independent sets. These objects can be equivalently defined as the sets of points in for which is not a basis of for any four-dimensional flat . We prove a decomposition theorem that exactly determines the structure of all -free and triangle-free matroids. In particular, our theorem implies that the -free and triangle-free matroids have critical number at most .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.