Extremal and probabilistic combinatorics

Utbildningsfakta

Kod: 5MA214

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.

Behörighet

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

Utbildningstillfällen

Varje tillfälle har egna datum och villkor. Avslutade tillfällen behålls som historik och innebär inte att en ny ansökan är öppen.

• Extremal and probabilistic combinatorics

  Umeå University

  Startdatum: 18 januari 2027

  Slutdatum: 24 mars 2027

  Studietakt: 50 %