[PAST EVENT] Mathematics Colloquium: Michael Tait (Carnegie Mellon University)
Access & Features
- Open to the public
Mathematics Colloquium: Michael Tait (Carnegie Mellon University)
Title: Algebraic methods in extremal graph theory
Abstract: How many edges may a graph with no triangle have? Given a graph F, the Turan problem asks to maximize the number of edges in a graph on n vertices subject to the constraint that it does not contain F as a subgraph. In this talk, we will discuss constructions for this problem coming from finite geometry (eg using projective planes), combinatorial number theory, and "random polynomials".