**Intensive Lecture Series**

School of Mathematics, Birmingham University, Birmingham, UK

In this lecture, we aim to learn several techniques to find sufficient conditions on a dense graph G to contain a sparse graph H as a subgraph.

Lecture note (PDF file)

**Tentative plan for the course (June 25, 26, 27, 28, 29)**

Lecture 1 : Basic probabilistic methods

Lecture 2 : Extremal number of graphs

Lecture 3 : Extremal number of even cycles

Lecture 4 : Dependent random choice

Lecture 5 : The regularity lemma and its applications

Lecture 6 : Embedding large graphs

Lecture 7 : The blow-up lemma and its applications I

Lecture 8 : The blow-up lemma and its applications II

Lecture 9 : The absorbing method I

Lecture 10 : The absorbing method II