기초과학연구원 이산수학그룹
The IBS Discrete Mathematics Group welcomes Dr. Xiying Du, a new research fellow at the IBS Discrete Mathematics Group, starting on September 1, 2026.
She received her Ph.D. from the Georgia Institute of Technology under the supervision of Prof. Rose McCarty and Prof. Xingxing Yu. She is interested in structural graph theory, in particular graph linkages, degree-boundedness, and induced subgraphs.
The IBS Discrete Mathematics Group welcomes Dr. William J. Wesley, a new research fellow at the IBS Discrete Mathematics Group, starting September 1, 2026.
He received his Ph.D. from the University of California, Davis under the supervision of Prof. Jesús A. De Loera. Until recently, he was an SEW Visiting Assistant Professor at the University of California, San Diego. His research is focused primarily on computational Ramsey theory, and he is more broadly interested in combinatorics, algebra, and optimization.
The IBS Discrete Mathematics Group welcomes Dr. Mingyuan Rong, a new research fellow at the IBS Extremal Combinatorics and Probability Group, starting September 1, 2026.
Mingyuan Rong received his Ph.D. from the University of Science and Technology of China under the supervision of Prof. Jie Ma. Until recently, he was a Visiting Student Researcher at the University of Warwick, working with Prof. Oleg Pikhurko. He is interested in extremal set theory and extremal graph theory.
ASIACOMB 2026, the inaugural conference of the ASIACOMB series, was held at the Daejeon Convention Center (DCC) in Daejeon, Korea from August 24 to August 28, 2026. ASIACOMB is a biennial conference held in Asia that promotes international collaboration by strengthening research connections and providing a high-level forum for ideas in combinatorics. It was organized by the IBS Extremal Combinatorics and Probability Group, with Hong Liu (IBS ECOPRO) as the chair of the organizing committee, together with Felix Christian Clemen (University of Victoria), Zichao Dong (IBS ECOPRO), Seonghyuk Im (KIAS), Suyun Jiang (Jianghan University), and Zhuo Wu (Universitat Politècnica de Catalunya).
The conference featured nine plenary talks, a prize winner talk by Huy Tuan Pham, the winner of the Asian Prize for Combinatorics, as well as 145 contributed talks and 6 poster presentations.
The plenary speakers were:
On August 18, 2026, Jinyoung Park (박진영) from NYU gave a talk at the Discrete Math Seminar on a reformulation of the Discrete Convexity Conjecture of Talagrand. The title of her talk was “A reformulation of Talagrand’s Discrete Convexity Conjecture“.
The IBS discrete mathematics group welcomes Dr. Daniel McGinnis, a new research fellow at the IBS Discrete Mathematics Group from August 16, 2026. He received his Ph.D. from the University of Iowa under the supervision of Prof. Shira Zerbib in 2024 and was subsequently a postdoctoral researcher at Princeton University. He is interested in combinatorics, discrete geometry, and combinatorial topology.
About 100 people attended the 2026 Summer School on Combinatorics and Algorithms from August 10 to August 14, 2026, held at KAIST. Daniel Dadush from CWI and Magnus Wahlström from the Royal Holloway, University of London gave lectures. This school was organized by Jungho Ahn (Inha University), Eun Jung Kim (KAIST / IBS / CNRS), Eunjin Oh (POSTECH), and Sang-il Oum (IBS Discrete Mathematics Group).
On August 7, 2026, Hyunwoo Lee (이현우) from KAIST and IBS Extremal Combinatorics and Probability Group gave a talk at the Discrete Math Seminar on a recent super-exponential lower bound for the multicolor triangle Ramsey number by OpenAI. The title of his talk was “A super-exponential lower bound construction for the multicolor triangle Ramsey problem discovered by OpenAI“.
On August 5, 2026, Meike Hatzel from TU Darmstadt gave a talk at the Discrete Math Seminar on a structural characterization of digraphs not immersing a cylindrical grid. The title of her talk was “Directed tree-cutwidth and immersions“.
On August 4, 2026, Tomohiro Koana from University of Tokyo gave a talk at the Discrete Math Seminar on a single-exponential fixed-parameter algorithm for enlarging a subgraph with at most k edges to make a 2-connected subgraph of a given graph. The title of his talk was “A Single-Exponential FPT Algorithm for 2-Vertex-Connectivity Augmentation“.