기초과학연구원 이산수학그룹
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“.
On July 28, 2026, Stephan Kreuter from TU Berlin gave a talk on the disjoint paths problem on undirected graphs and directed graphs at the Discrete Math Seminar. The title of his talk was “Disjoint Paths in Graphs and Digraphs“.
On July 21, 2026, Zichao Dong from the IBS Extremal Combinatorics and Probability Group gave a talk on the maximum size of a set family in which, for each i ≤ k, every intersection of i members has a prescribed parity at the Discrete Math Seminar. The title of his talk was “k-wise odd-even towns“.
On July 16, 2026, Sang-il Oum from the IBS Discrete Mathematics Group gave a talk on a recent proof the cycle double cover conjecture by OpenAI at the Discrete Math Seminar. The title of his talk was “A proof of the cycle double cover conjecture by OpenAI“.
On July 14, 2026, Yaobin Chen from the IBS Extremal Combinatorics and Probability Group gave a talk at the Discrete Math Seminar on the maximum size of a subset in general position of a random subset of a finite-dimensional vector space over a finite field. The title of his talk was “Maximum in-general-position set in a random subset of $\mathbb{F}_q^d$“.
On July 10, 2026, Ting-Wei Chao from MIT gave a talk at the Discrete Math Seminar on a variation of the odd town problem. The title of his talk was “The Oddtown Problem Modulo a Composite Number“.
On June 19, 2026, Stefan Weltge from the Technical University of Munich gave a talk at the Discrete Math Seminar on the minimum number of inequalities whose integer solutions are precisely standard unit vectors. The title of his talk was “The relaxation complexity of the standard simplex is logarithmic“.
On June 16, 2026, Harry Richman gave a talk on an algorithm to compute tropical Weierstrass weights at the Discrete Math Seminar. The title of his talk was “Distinguishing graphs with tropical Weierstrass weights“.
On June 9, 2026, J. Pascal Gollin from University of Primorska gave a talk at the Discrete Math Seminar on the existence of a balanced separator dominated by a small number of vertices in a graph excluding a wheel as an induced minor. The title of his talk was “Dominated balanced separators in wheel-induced-minor-free graphs“.
On June 2, 2026, Maria Chudnovsky from Princeton University gave a talk on bounding treewidth of n-vertex graphs excluding fixed induced minors as a function of n at the Discrete Math Seminar. The title of her talk was “Induced minors and treewidth“.