The structure of I4-free and triangle-free binary matroids
Abstract
A simple binary matroid is called I4-free if none of its rank-4 flats are independent sets. These objects can be equivalently defined as the sets E of points in PG(n-1,2) for which |E F| is not a basis of F for any four-dimensional flat F. We prove a decomposition theorem that exactly determines the structure of all I4-free and triangle-free matroids. In particular, our theorem implies that the I4-free and triangle-free matroids have critical number at most 2.
0