News

Up to 3 senior researchers. For more details, see https://www.ibs.re.kr/prog/recruit/eng/sub04_01/view.do?pageIndex=1&searchCondition=&searchKeyword=&idx=1971

The 1st Early Career Workshop in Extremal Combinatorics will be held on October 20–30, 2025 at IBS headquarter, Daejeon, Korea. For more details, see the page: https://www.ibs.re.kr/ecopro/1st-early-career-workshop-in-extremal-combinatorics-2025/

With Joonkyung Lee, we organize a workshop on Discrete Analysis at Yonsei University in Seoul. For more details, see https://sites.google.com/yonsei.ac.kr/days

Invited speakers

• Jineon Baek (Yonsei U.)
• David Conlon (Caltech)
• Seonghyuk Im (KAIST/IBS ECOPRO)
• Jaehoon Kim (KAIST)
• Sam Mattheus (VU Brussel)
• Huy Tuan Pham (IAS)
• Bjarne Schülke (IBS ECOPRO)
• Tibor Szabó (FU Berlin)
• Semin Yoo (IBS DIMAG)
• Yi Zhao (Georgia State U.)

Organizers

• Joonkyung Lee, Yonsei University
• Hong Liu, IBS

This year’s summer school is taking place on July 28-August 8, 2025. All information, including lecture notes, recordings will be available on the course homepage: https://www.ibs.re.kr/ecopro/summer-2025/

Location: Room B332, IBS, Daejeon
Zoom: 3469344087, PW: 2025

Lecturers:
Lior Gishboliner (University of Toronto): Around removal lemmas
Yuval Filmus (Technion): Introduction to Boolean Algebra

This year’s winter school is taking place on Jan 6-10, 2025. All information, including lecture notes, recordings will be available on the course homepage: https://www.ibs.re.kr/ecopro/winter-2025/

Lecturer: Huy Pham (IAS)

Recent developments in probabilistic combinatorics: New synergies

Recent developments in probabilistic combinatorics have brought about synergistic interactions across multiple disciplines, including extremal combinatorics, probability theory and theoretical computer science. This mini-course aims to give an introduction to some of these developments and interactions. 

In the first part of the mini-course, we will discuss the Kahn-Kalai conjecture on thresholds and expectation thresholds and its close relation to Talagrand’s selector process conjecture in probability theory. We will also touch on several subsequent developments of the proof technique in extremal combinatorics, probability theory and theoretical computer science. 

The Kahn-Kalai conjecture opens up a new avenue on thresholds of interesting properties in random graph models. Yet, while it relates thresholds to the expectation thresholds, estimation of the latter remains a highly challenging task in general. Recent developments have found close connections between this task and previous fundamental developments in extremal combinatorics, such as the regularity method. In the second part of the mini-course, I will briefly overview classical aspects of the regularity method before discussing its new applications to thresholds and other problems in probabilistic combinatorics.

This year’s autumn course will start on September 24. All information, including lecture notes, recordings will be available on the course homepage: https://www.ibs.re.kr/ecopro/autumn-2024/

The classes will take place every Tuesday and Thursday morning. We will go over various methods in extremal combinatorics.

Eng Keat is starting his position from September 1, 2024. Previously, he received his Ph.D. from the London School of Economics and Political Science in 2022 under the supervision of Julia Böttcher and Peter Allen and was a postdoc researcher at the Czech Academy of Sciences.