Super-minimally $3$-connected matroids

Abstract

A super-minimally $k$-connected matroid is a $k$-connected matroid having no proper $k$-connected restriction of size at least $2k-2$. This extends the corresponding concept for graphs. For $k=2$ and $k=3$, we determine the maximum size of a super-minimally $k$-connected rank-$r$ matroid and characterize, in each case, those matroids attaining the extremal bound. These results parallel Murty's results for minimally $2$-connected matroids and Oxley's results for minimally $3$-connected matroids.

14 pages, 2 figures