• J. Pascal Gollin, Dominated balanced separators in wheel-induced-minor-free graphs

    Room B332 IBS (기초과학연구원)

    The grid theorem of Robertson and Seymour can be equivalently stated using balanced separators, that are separators whose deletion leaves every component with no more than half of the vertices of the graph, as follows. Every graph that excludes some planar graph as a minor has a balanced separator of bounded size. Building on this

  • Harry Richman, Distinguishing graphs with tropical Weierstrass weights

    Room B332 IBS (기초과학연구원)

    I will introduce a new structure on finite graphs, which takes the form of a labeling of the vertices by nonnegative integers (possibly repeated). This labeling is isomorphism invariant, and seems to reflect some mix of local and global structure of the graph. I will describe an algorithm for computing these labels, which uses a

  • Stefan Weltge, Multiplicative assignment with upgrades

    Room B332 IBS (기초과학연구원)

    We study a problem related to submodular function optimization and the exact matching problem for which we show a rather peculiar status: its natural LP-relaxation can have fractional optimal vertices, but there is always also an optimal integral vertex, which we can also compute in polynomial time. More specifically, we consider the multiplicative assignment problem

  • 2026 Workshop on Topological Combinatorics

    GIST

    The 2026 Workshop on Topological Combinatorics will be held from June 28 to July 11, 2026 at Gwangju Institute of Science and Technology (GIST), located in Gwangju in the southwest of Republic of Korea.  The workshop aims to bring together researchers interested in applications of topology to combinatorics and related areas. This will be the

  • Ting-Wei Chao, The Oddtown Problem Modulo a Composite Number

    Room B332 IBS (기초과학연구원)

    A family of sets in $$ is called an $\ell$-Oddtown if the sizes of all sets are not divisible by $\ell$, but the sizes of pairwise intersections are divisible by $\ell$. The problem was completely solved when $\ell$ is a prime via an elegant linear algebraic method, showing that the family has size at most

  • Meike Hatzel, TBA

    Room B332 IBS (기초과학연구원)
  • 2026 Summer School on Combinatorics and Algorithms (2026 조합론 및 알고리즘 여름학교)

    Bldg. E11, KAIST

    The 2026 Summer School on Combinatorics and Algorithms is a venue for students and early-career researchers to learn selected topics in theoretical computer science and discrete mathematics. It will be a great opportunity for young and aspiring researchers to study topics which are important but not covered during the lectures in the university classes. Website: