Speaker: Michael Wigal (UIUC)
Title: Turán densities for matroid basis hypergraphs
Abstract: Let U be a uniform matroid. What is the maximum number of bases of an n-element rank-r matroid without U as a minor? We will show this question arises by restricting the problem of determining the Turán number of daisy hypergraphs to the family of matroid basis hypergraphs. We answer this question for interesting choices of U and will give some open problems.
Joint work with Jorn van der Pol and Zach Walsh