Title: Matroids without cliquesSpeaker: Peter Nelson Affiliation: University of Waterloo Location: MC 5501 or contact Eva Lee for Zoom link
Abstract: The class of graphs that omit some fixed complete graph as a minor is very well-studied; in particular, the densest graphs in the class are known. The analogous question for matroids is just as well-motivated, but seems harder to answer. I will discuss some recent progress in this area, which reduces a bound from doubly exponential to singly exponential. This is joint work with Sergey Norin and Fernanda Rivera Omana.