seminar Archives - Discrete Mathematics Group

August 7, 2026August 7, 2026

Hyunwoo Lee (이현우) gave a talk on a recent new lower bound for the multicolor triangle Ramsey number by OpenAI at the Discrete Math Seminar

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“.

August 5, 2026August 5, 2026

Meike Hatzel gave a talk on a structural characterization of digraphs not immersing a cylindrical grid at the Discrete Math Seminar

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“.

August 5, 2026August 5, 2026

Tomohiro Koana gave a talk on a faster FPT algorithm for expanding a subgraph to be a 2-connected subgraph of a given graph by adding at most k edges

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“.

July 28, 2026

Stephan Kreutzer gave a talk on the disjoint paths problem at the Discrete Math Seminar

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“.

July 22, 2026July 22, 2026

Zichao Dong 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

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“.

July 16, 2026July 16, 2026

Sang-il Oum (엄상일) gave a talk at the Discrete Math Seminar on a recent proof of the cycle double cover conjecture by OpenAI

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“.

July 14, 2026July 14, 2026

Yaobin Chen gave a talk on the maximum size of a subset in general position of a random subset of a finite-dimensional vector space over a finite field

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$“.

July 11, 2026July 11, 2026

Ting-Wei Chao gave a talk on a variation of the odd town problem at the Discrete Math Seminar

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“.

June 20, 2026June 20, 2026

Stefan Weltge gave a talk on the minimum number of inequalities whose integer solutions are standard unit vectors at the Discrete Math Seminar

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“.

June 19, 2026June 19, 2026

Harry Richman gave a talk on an algorithm to compute tropical Weierstrass weights at the Discrete Math Seminar

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“.

Category: seminar