On the structure of dense triangle-free binary matroids
classification
🧮 math.CO
keywords
binarytriangle-freecriticaldensedescriptioneveryexactmatroid
read the original abstract
We prove, by means of an exact structural description, that every simple triangle-free binary matroid $M$ with $|M| > \tfrac{33}{128}2^{r(M)}$ has critical number at most $2$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.