Tutte Colloquium - Peter Nelson

Friday, December 1, 2017 3:30 pm - 3:30 pm EST (GMT -05:00)

Title: Turan problems for matroids

Speaker: Peter Nelson
Affiliation: University of Waterloo
Room: MC 5501


Given a fixed simple binary matroid N, what is the maximum size of a simple rank-r binary matroid that does not contain N a restriction? We discuss this question, analogies to similar problems in graph theory, and deep tools in additive combinatorics that allow us to give a surprisingly precise answer in many cases.