Extremal Combinatorics

In Extremal Combinatorics we study problems of the form ``How large (or small) can a parameter associated to a finite structure be under certain restrictions"? In this course we will study several problems of this kind and learn some exciting theorems from Ramsey theory, extremal set theory, etc. There will be an equal emphasis on the methods used to solve these problems. In particular, we will learn the probabilistic method, polynomial method and topological method.

The final grade of the course consists of the following components:

- Written exam (100%)

In case of an insufficient result, repair opportunities may be offered in accordance with TER Implementation Regulations Art 5, sub 5., for:

- Written exam: written resit

Disclaimer: information may change depending on unforeseen circumstances or measures (see: TER Art 29, sub 4).