기초과학연구원 이산수학그룹
On September 22, 2026, David R. Wood from Monash University gave a talk on coloring graphs without K_t minor with t colors while avoiding large monochromatic components at the Discrete Math Seminar. The title of his talk was “Proof of the Clustered Hadwiger Conjecture“.
On September 18, 2026, David R. Wood from Monash University gave a talk showing the proof of the Erdős-Sós conjecture found by GPT Astra at the Discrete Math Seminar. The title of his talk was “The Erdős-Sós Theorem“.
On September 15, 2026, Gabriëlle Zwaneveld from University of Amsterdam gave a talk on oriented graphs with the same number of neighbors and second neighbors at each vertex, motivated by Seymour’s second neighborhood conjecture, at the Discrete Math Seminar. The title of her talk was “On Seymour-tight orientations“.
On September 8, 2026, Olga Medrano Martín del Campo from the IBS Discrete Mathematics Group gave a talk on ε-saturation of classes of graphs of bounded Littlestone dimension and VC dimension at the Discrete Math Seminar. The title of her talk was “Epsilon-saturation for Littlestone classes and stable graphs“.
On September 1, 2026, Ben Lund from Xidian University, China gave a talk at the Discrete Math Seminar on an upper bound of the number of incidences between points and n-dimensional projective subspaces in PG(n+d,q). The title of his talk was “Incidences between points and n-flats in PG(n+d,q)“.
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“.
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“.
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“.