A geometric version of the Andrasfai-Erdos-Sos theorem

TL;DR

This paper establishes a geometric analogue of a classical extremal graph theory theorem for binary matroids, providing bounds on matroid size and structure based on forbidden circuits and restrictions.

Contribution

It introduces a new geometric version of the Andrasfai-Erdos-Sos theorem for binary matroids, with tight bounds and simplified proofs for related extremal results.

Findings

Proves a tight bound for binary matroids with no small odd circuits

Provides a simplified proof of a matroid extremal theorem by Govaerts and Storme

Establishes a geometric analogue of a classical graph theory result

Abstract

For each odd integer $k\ge 5$, we prove that, if $M$ is a simple rank-$r$ binary matroid with no odd circuit of length less than $k$ and with $|M| > k 2^{r-k+1}$, then $M$ is isomorphic to a restriction of the rank-$r$ binary affine geometry; this bound is tight for all $r\ge k-1$. We use this to give a simpler proof of the following result of Govaerts and Storme: for each integer $n\ge 2$, if $M$ is a simple rank-$r$ binary matroid with no $PG(n-1,2)$-restriction and with $|M| > \left(1-\frac{11}{2^{n+2}}\right) 2^r$, then $M$ has critical number at most $n-1$. That result is a geometric analogue of a theorem of Andrasfai, Erdos, and Sos in extremal graph theory.