기초과학연구원 이산수학그룹
On October 8, 2024, Mathias Schacht from the University of Hamburg gave a talk at the Discrete Math Seminar on the existence of a canonically colored copy of a fixed graph in a random graph. The title of his talk was “Canonical colourings in random graphs“.
On September 24, 2024, Gábor Tardos from the Rényi Institute of Mathematics gave a talk at the Discrete Math Seminar on the extremal problems on 0-1 matrices. The title of his talk was “Extremal theory of 0-1 matrices“.
On September 10, 2024, Zhihan Jin (金之涵) from ETH Zürich gave a talk at the Discrete Math Seminar on the analog of Helly’s theorem inside the Hamming cube. The title of his talk was “The Helly number of Hamming balls and related problems“.
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“.
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“.
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“.
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“.
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“.
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“.
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“.