기초과학연구원 이산수학그룹
This talk is an introduction to the recent notion of merge-width, proposed by Jan Dreier and Szymon Torúnczyk. I will give an overview of the context and motivations for merge-width, namely the first-order model checking problem, and present the definition, some examples, and some basic proof techniques with the example of χ-boundedness. This is based …
The matroid intersection problem is a fundamental problem in combinatorial optimization. In this problem we are given two matroids and the goal is to find the largest common independent set in both matroids. This problem was introduced and solved by Edmonds in the 70s. The importance of matroid intersection stems from the large variety of …
T.B.A.
Venue The K-Hotel Gyeongju Website https://indico.ibs.re.kr/e/kscw2025 Organizers Seokbeom Kim (김석범), KAIST and IBS Discrete Mathematics Group Hyunwoo Lee (이현우), KAIST and IBS Extremal Combinatorics and Probability Group Jaehyeon Seo (서재현), Yonsei University Kyungjin Cho (조경진), POSTECH
The 5th East Asia Workshop on Extremal and Structural Graph Theory is a workshop to bring active researchers in the field of extremal and structural graph theory, especially in the East Asia such as China, Japan, and Korea. Date November 27, 2025 Thursday (Arrival Day) -- November 30, 2025 Sunday (Departure Day) Venue Seoul (TBA) …