The structure of $I_4$-free and triangle-free binary matroids
Combinatorics
2020-05-04 v1
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 .
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}
}