David Conlon "Recent progress in extremal graph theory"
David Conlon from Caltech will give the talk "Recent progress in extremal graph theory" on the labs' Big Seminar.
Password: first 6 decimal places of $\pi$
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.
Watch the lecture on youtube:
Everyone is invited to attend. The language of the lecture is English. The event is aimed at master and graduate students, as well as researchers in the field of combinatorics.