English

The structure of $I_4$-free and triangle-free binary matroids

Combinatorics 2020-05-04 v1

Abstract

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

Keywords

Cite

@article{arxiv.2005.00089,
  title  = {The structure of $I_4$-free and triangle-free binary matroids},
  author = {Peter Nelson and Kazuhiro Nomoto},
  journal= {arXiv preprint arXiv:2005.00089},
  year   = {2020}
}
R2 v1 2026-06-23T15:13:38.327Z