On the structure of dense $H$-free graphs

Speaker: Tomasz Luczak, Adam Mickiewicz University, Poznan, Poland

Characterizing the structure of a large graph $G$ which contains no copy of a given small subgraph $H$ is one of the most basic and extensively studied problems in extremal graph theory. In the talk we shall propose some new methods to approach these types of questions. This is a joint work with Stephan Thomasse.