This course introduces powerful probabilistic methods, and their applications to fundamental problems in extremal combinatorics. It includes an overview of classical probabilistic methods such as first- and second-moment methods and the Lóvasz local lemma, and of some fundamental notions and results in extremal combinatorics, such as set systems, sunflowers, antichains, graph partitions, and Turán-type problems. In addition, the course will treat a selection of related topics at the cutting-edge of research.
Extremal and probabilistic combinatorics, 7.5 credits
Spring Term 2025
The information below is only for exchange students
Starts
20 January 2025
Ends
24 March 2025
Study location
Umeå
Language
English
Type of studies
Daytime,
50%
Required Knowledge
The course requires a minimum of 90 ECTS in Mathematics or Computer Science, of which at least 60 ECTS must be in Mathematics including a course in Discrete Mathematics of at least 7.5 ECTS and a course in Statistics of at least 7.5 ECTS which includes elementary Probability Theory. Proficiency in English and Swedish equivalent to the level required for basic eligibility for higher studies
Selection
Students applying for courses within a double degree exchange agreement, within the departments own agreements will be given first priority. Then will - in turn - candidates within the departments own agreements, faculty agreements, central exchange agreements and other departmental agreements be selected.
Application code
UMU-A5833
Application
This application round is only intended for nominated exchange students. Information about deadlines can be found in the e-mail instruction that nominated students receive.
The application period is closed.
