Thursday, September 19, 2019 4:00 pm
-
4:00 pm
EDT (GMT -04:00)
Title: The sparsest matroids omitting an independent flat
| Speaker: | Peter Nelson |
| Affiliation: | University of Waterloo |
| Room: | MC 5501 |
Abstract:
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.