Title: The sparsest matroids omitting an independent flat
|Affiliation:||University of Waterloo|
Given integers $k,r \ge 1$, what is the smallest a rank-$r$ matroid can be that does not contain a $k$-element independent set that is also a flat? I will answer this question, characterize the extremal examples, and draw parallels with a problem in graph theory.
200 University Avenue West
Waterloo, ON N2L 3G1