Syllabus
Turan's theorem and its generalizations applications of regularity lemma probabilistic arguments, dependent random choice containers quasirandom graphs flag algebras and graph limits
Annotation
Extremal graph theory studies maximal or minimal graphs satisfying given conditions. The course covers the basic results (especially generalizations and refinements of Turan's theorem) and methods (usage of regularity lemma, probabilistic techniques, stability) of extremal graph theory. We will also mention newer results using flag algebras and graph limits.