기초과학연구원 이산수학그룹
On March 24, 2026, Hidde Koerts from the University of Waterloo gave a talk at the Discrete Math Seminar on characterizing tournaments with no backedge graph of small clique number. The title of his talk was “Characterizing large clique number in tournaments“.
On March 12, 2026, József Balogh from the University of Illinois at Urbana-Champaign gave a talk on decomposing the edge set of a graph into edge sets of clliques or covering by edge sets of cliques at the Discrete Math Seminar. The title of his talk was “Clique covers and decompositions of cliques of graphs“.
On March 10, 2026, Dario Cavallaro from the TU Berlin gave a talk at the Discrete Math Seminar on well-quasi-ordering of Eulerian digraphs under (strong) immersion. The title of his talk was “Well-quasi-ordering Eulerian directed graphs by (strong) immersion“.
On March 3, 2026, Chính T. Hoàng from the Wilfrid Laurier University, Waterloo, Canada gave a survey talk on graph coloring and forbidden induced subgraphs at the Discrete Math Seminar. The title of his talk was “Problems on graph coloring“.
On February 24, 2026, Marek Sokołowski from the Max Planck Institute of Informatics gave a talk at the Discrete Math Seminar on a new parallel algorithm computing single-source shortests paths in directed graphs. The title of his talk was “Strongly Polynomial Parallel Work-Depth Tradeoffs for Directed SSSP“.
On February 10, 2026, Seonghun Park (박성훈) from KAIST gave a talk on formalizing the flag algebra introduced by Alexander Razborov in the lean theorem prover. The title of his talk was “Formalizing Flag Algebras in the Lean Theorem Prover“.
On February 3, 2026, Xiaofan Yuan from the IBS Extremal Combinatorics and Probability Group gave a talk at the Discrete Math Seminar on the minimum color-degree condition for the existence of a rainbow path between any pair of vertices and its applications. The title of her talk was “Rainbow structures in edge colored graphs“.
On January 27, 2025, Daniel Dadush from CWI gave a talk at the Discrete Math Seminar on a strongly polynomial-time algorithm solve linear programming problems with at most two non-zero entries per each row or each column. The title of his talk was “A Strongly Polynomial Algorithm for Linear Programs with at Most Two Non-Zero Entries per Row or Column“.
On January 20, 2026, Tomáš Masařík from the University of Warsaw, Poland, gave a talk on a linear-time algorithm to find a balanced separator in an H-minor-free graph at the Discrete Math Seminar. The title of his talk was “Separator Theorem for Minor-free Graphs in Linear Time“.
On January 13, 2026, Ferdinand Ihringer from the Southern University of Science and Technology, China gave a talk on low-degree Boolean functions and appications of vector space Ramsey numbers at the Discrete Math Seminar. The title of his talk was “Boolean Functions Analysis in the Grassmann Graph“.