Summer 2026

  • Time: 9:00-10:30am (Beijing), 10:00-11:30am(Seoul)
  • Place: IBS ECOPRO B332 (Main building 3rd floor).
  • Jul 6 – Jul 10, Entropy method in extremal combinatorics
  • Jul 27 – Jul 31, Hypergraphs with Bounded VC-Dimension: Incidences, Zarankiewicz Problems, and Radon-Type Theorems
  • Zoom: 3469344087, PW: 2026


Entropy method in extremal combinatorics

Ting-Wei Chao, Massachusetts Institute of Technology

The entropy method has been used in many recent works in extremalcombinatorics. With the help of Shannon entropy, significant progresshas been made on several classical problems, such as the union-closed conjecture and Sidorenko’s conjecture. There are also recent new proofs of classic theorems and their generalizations using entropy, such as the Kruskal-Katona theorem and Turan’s theorem. We will cover the basics of entropy and talk about some applications to graph homomorphism counting problems.

  • 7/6 Lecture 1: NOTE 1
  • 7/7 Lecture 2:  NOTE 2
  • 7/8 Lecture 3:  NOTE 3
  • 7/9 Lecture 4: NOTE 4
  • 7/10 Lecture 5:  NOTE 5


Hypergraphs with Bounded VC-Dimension: Incidences, Zarankiewicz Problems, and Radon-Type Theorems

Shakhar Smorodinsky, Ben-Gurion University

The notion of VC-dimension, introduced in statistical learning theory, has become a central tool inmodern combinatorics, discrete geometry, and theoretical computer science. It provides a powerful way to measure the complexity of set systems, or equivalently hypergraphs, and many natural geometric hypergraphs have bounded VC-dimension. In this course, I will discuss the rich combinatorial theory of hypergraphs with bounded VC-dimension and some of its geometric manifestations. We will begin with the Sauer-Shelah-Perles lemma and its basic consequences and then move to epsilon-nets and related sampling and packing phenomena. We will studyextremal questions for graphs and hypergraphs of bounded VC-dimension, including Zarankiewicz-type problems and incidence bounds, together with tools such as the crossing lemma and polynomial partitioning. Further topics will include matchings with low crossing numbers, generalizations of epsilon-nets, and Radon- and Tverberg-type theorems for unions of convex sets.

  • 7/27 Lecture 1: NOTE 1
  • 7/28 Lecture 2:  NOTE 2
  • 7/29 Lecture 3:  NOTE 3
  • 7/30 Lecture 4: NOTE 4
  • 7/31 Lecture 5:  NOTE 5

ECOPRO 2025 Summer Research Program Successfully Concludes

From July 1 to August 31, 2025, the Extremal Combinatorics and Probability Group (ECOPRO) at the Institute for Basic Science (IBS), Korea, successfully hosted its Summer Research Program. The program brought together outstanding undergraduate and graduate students from multiple universities, engaging them in two months of intensive study and research in combinatorics, graph theory, discrete geometry, and related areas.

During the program, participants systematically studied frontier research literature and took part in focused discussions and research projects under the guidance of ECOPRO members. Through regular seminars and academic exchanges, students deepened their understanding of extremal combinatorics and achieved substantive progress on specific problems.

In addition, ECOPRO organized a series of high-level lectures and small-scale workshops, inviting experts in the field to share recent research developments. These activities provided valuable opportunities for participants to broaden their academic perspectives and engage with the international research frontier. The program maintained a vibrant and rigorous academic atmosphere, fostering sustained interest in fundamental theoretical research.

The successful completion of this summer program not only continues ECOPRO’s tradition of nurturing young researchers, but also further strengthens its role as an international platform for academic exchange. The IBS ECOPRO group looks forward to organizing similar programs in the future, attracting talented students passionate about combinatorics and contributing to the advancement of the field.

Korean Student Combinatorics Workshop

The Korean Student Combinatorics Workshop (KSCW) aims to provide a platform for Korean graduate students, undergraduate students, and postdoctoral researchers studying combinatorics to build professional networks, share their research interests, and foster collaborative research.

The 2026 Winter Korean Student Combinatorics Workshop (KSCW 2026 Winter) will be held from February 2 to 6, 2026, at Shilla Stay Yeosu, with support from IBS ECOPRO.

All information is available on the workshop homepage: https://kscw.combinatorics.kr/2026w/

Winter school 2026

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.

Discrete Analysis workshop at Yonsei

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

Organizers

Summer school 2025

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

Winter school 2025

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.

IBS Extremal Combinatorics and Probability Group
기초과학연구원 수리및계산과학연구단 극단 조합 및 확률 그룹
대전 유성구 엑스포로 55 (우) 34126
IBS Extremal Combinatorics and Probability Group (ECOPRO)
Institute for Basic Science (IBS)
55 Expo-ro Yuseong-gu Daejeon 34126 South Korea
E-mail: ecopro@ibs.re.kr, Fax: +82-42-878-9209
Copyright © IBS 2021. All rights reserved.