Skip to content
Main menu hidden.

Current Topics and Algorithms in Combinatorics

  • Number of credits 7.5 credits

About the course

This course covers recent theoretical and algorithmic developments in combi-natorics. It begins with an overview of classical probabilistic methods such as first- and second-moment methods and the local lemma, and of some funda-mental notions and results in extremal combinatorics, such as set systems, graph partitions, and Turán-type problems. The courses then moves on to give an in-depth treatment of the following topics at the cutting-edge of research:the Moser-Tardos algorithm, and derandomization of probabilistic algo-rithms more generally;
recent improvements to the Sunflower Lemma and their application to com-puter science and the study of random graphs;
the method of Hypergraph Containers and its applications;
Vapnik-Chervonenkis dimension and its applications to statistical learning and computational geometry.

Contact us

Please be aware that the University is a public authority and that what you write here can be included in an official document. Therefore, be careful if you are writing about sensitive or personal matters in this contact form. If you have such an enquiry, please call us instead. All data will be treated in accordance with the General Data Protection Regulation.

Contactperson for the course is:
Study counselor Lars-Daniel Öhman