**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.

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

Lecture 1 : Basic probabilistic methods

Lecture 2 : Turan numbers

Lecture 3 : Bipartite Turan numbers and dependent random choice

Lecture 4 : The regularity lemma and its applications

Lecture 5 : Embedding large graphs

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

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

Lecture 8 : The absorbing method

Lecture 9 : Graph packing problems and iterative absorption I

Lecture 10 : Graph packing problems and iterative absorption II