## Extremal Graph Theory with Flag Algebras

- Nov. 3, 2017
- 2:30 p.m.
- LeConte 310

## Abstract

Similar to optimization, questions in extremal graph theory ask for the maximum or minimum of a graph parameter under certain constraints. Although convex programming provides a powerful tool to solve numerical optimization questions, questions in extremal graph theory have historically been approached by ingenuity and trial-and-error. Recently, Razborov developed the theory of flag algebras, which provides a method of translating an extremal graph theory problem to a semidefinite programming problem. In this talk, we will explore the process of this translation in the context of subgraph density.