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
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
Guaranteed place
Applicants in some programs at Umeå University have guaranteed admission to this course. The number of places for a single course may therefore be limited.
Application code
UMU-58113
Application
Application deadline was
15 October 2024.
The application period is closed.
Application and tuition fees
As a citizen of a country outside the European Union (EU), the European Economic Area (EEA) or Switzerland, you are required to pay application and tuition fees for studies at Umeå University.
