David Conlon 'Recent progress in extremal graph theory' | Big Seminar

David Conlon from Caltech gave the talk "Recent progress in extremal graph theory" on the labs' Big Seminar.

___

Abstract:

The extremal number ex(n, H) of a graph H is the largest number of edges in an n-vertex graph containing no copy of H. In this talk, we will describe some of the recent progress that has been made on understanding this question in the difficult case when H is bipartite.