This year’s winter school is taking place on Jan 19-23, 2026. All information, including lecture notes, recordings will be available on the course homepage: https://www.ibs.re.kr/ecopro/winter-2026/
Lecturer: Eero Räty (IBS ECOPRO)
Recent advances in cut-problems on graphs
This mini-course will serve as an introduction to cut problems in graphs and related topics. The course will begin by covering the basics of spectral graph theory, including the Alon–Boppana theorem and the expander mixing lemma. We will then introduce some fundamental tools in the field, such as the Goemans–Williamson algorithm, along with its applications to various types of max-cut problems in graphs and hypergraphs. Towards the end of the course, we will explore recent advancements in the area, which rely on more involved spectral properties of adjacency matrices.
