On September 6, 2024, Neal Bushaw from Virginia Commonwealth University gave a talk at the Discrete Math Seminar on the rainbow version of the saturation problem. The title of his talk was “Edge-colored Extremal Problems“.
Amadeus Reinald gave a talk on finding an oriented tree inside a digraph of large chromatic number at the Discrete Math Seminar
On September 3, 2024, Amadeus Reinald from LIRMM, Université de Montpellier gave a talk at the Discrete Math Seminar on the existence of every oriented tree of fixed size inside a digraph of large chromatic number. The title of his talk was “Oriented trees in $O(k\sqrt k)$-chromatic digraphs, a subquadratic bound for Burr’s conjecture“.
Dillon Mayhew gave a talk on the monadic second-order definability of gain-graphic matroids at the Discrete Math Seminar
On August 27, 2024, Dillon Mayhew from the University of Leeds gave a talk at the Discrete Math Seminar on the monadic second-order definability of gain-graphic matroids. The title of his talk was “Monadic second-order definability for gain-graphic matroids“.
Peter Nelson gave a talk on formalizing the matroid theory at the Discrete Math Seminar
On August 14, 2024, Peter Nelson from the University of Waterloo gave a talk at the Discrete Math Seminar on formalizing the matroid theory on LEAN at the Discrete Math Seminar. The title of his talk was “Formalizing matroid theory in a proof assistant“.
Daniel Král’ gave a talk on the minor closure of matroid depth parameters at the Discrete Math Seminar
On August 6, 2024, Daniel Král’ from Masaryk University gave a talk at the Discrete Math Seminar on the minor closures of depth parameters of matroids. The title of his talk was “Matroid depth and width parameters“.
Euiwoong Lee (이의웅) gave a talk on the parameterized complexity of approximating the minimum size of a deletion set to make a graph belong to a fixed class
On July 30, 2024, Euiwoong Lee (이의웅) from the University of Michigan gave a talk at the Discrete Math Seminar on the parameterized complexity of approximating the minimum size of a deletion set to make a graph belong to a fixed class. The title of his talk was “Parameterized Approximability of F-Deletion Problems“.
Hyunwoo Lee (이현우) gave a talk on disproving Kahn’s conjecture on matchings in d-regular linear hypergraphs at the Discrete Math Seminar
On July 5, 2024, Hyunwoo Lee (이현우) from KAIST and the IBS Extremal Combinatorics and Probability Group gave a talk at the Discrete Math Seminar on disproving Kahn’s conjecture (1995) on matchings in d-regular linear hypergraphs. The title of his talk was “Random matchings in linear hypergraphs“.
Kisun Lee (이기선) gave a talk on a combinatorial characterization of symmetric matrices of symmetric tropical rank 2 at the Discrete Math Seminar
On July 2, 2024, Kisun Lee (이기선) from Clemson University gave a talk at the Discrete Math Seminar on a combinatorial characterization of symmetric matrices of symmetric tropical rank 2. The title of his talk was “symmetric tropical rank 2 matrices“.
Wonwoo Kang (강원우) gave a talk on cluster algebras from punctured surfaces at the Discrete Math Seminar
On June 28, 2024, Wonwoo Kang (강원우) from UIUC gave a talk on cluster algebras from punctured surfaces. The title of his talk was “Skein relations for punctured surfaces“.
Semin Yoo (유세민) gave a talk on a generalization of Paley graphs and the quasi-randomness at the Discrete Math Seminar
On June 18, 2024, Semin Yoo (유세민) from the IBS Discrete Mathematics Group gave a talk at the Discrete Math Seminar on a generalization of Paley graphs and the quasi-randomness. The title of her talk was “Paley-like quasi-random graphs arising from polynomials“.











