Despite the effectiveness of the probabilistic method in extremal combinatorics, explicit constructive approaches remain of paramount importance. On the one hand, they are often superior to purely existential arguments, and, even when they are not, the search for the most efficient deterministic combinatorial structure is naturally motivated by questions of complexity.
The course discusses classic Turan- and Ramsay-type problems of extremal combinatorics from this constructive perspective.
Besides combinatorics, the methods often involve algebraic and probabilistic techniques (affine and projective geometries over finite fields, eigenvalues and quasirandom graphs, the discrete Fourier transform).
For further details please check Prof. Szabó's homepage.