Tutte Colloquium - Peter Nelson

Title: Turan problems for matroids

Abstract:

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.