기초과학연구원 이산수학그룹
On November 30, 2021, Seonghyuk Im (임성혁) from KAIST gave a talk at the Discrete Math Seminar on the existence of a large complete topological minor in a graph of bounded average degree when the graph has no small dense subgraphs. The title of his talk was “Large clique subdivisions in graphs without small dense subgraphs“.
On November 25, 2021, Tuukka Korhonen from the University of Bergen gave an online talk on a faster FPT-approximation algorithm for rank-width at the Virtual Discrete Math Colloquium. The title of his talk was “Fast FPT-Approximation of Branchwidth“.
On November 23, 2021, Casey Tompkins from the IBS Discrete Mathematics Group gave a talk at the Discrete Math Seminar on the poset Ramsey number for Boolean lattices. The title of his talk was “Ramsey numbers of Boolean lattices“.
On November 11, 2021, Sebastian Wiederrecht from LIRMM gave an online talk at the Virtual Discrete Math Colloquium on building the graph structure theory for matching minors. The title of his talk was “Matching Minors in Bipartite Graphs“.
On November 9, 2021, Jaehoon Kim (김재훈) from KAIST gave a talk at the Discrete Math Seminar on a 3-dimensional analog of Whitney’s theorem on the uniqueness of planar embeddings of a 3-connected graph. The title of his talk was “2-complexes with unique embeddings in 3-space“.
On November 5, 2021, Martin Milanič from the University of Primorska, Slovenia gave an online talk at the Virtual Discrete Math Colloquium on a variation of tree-width by measuring the width of a tree-decomposition by the size of the largest stable set in a bag and its algorithmic applications to the maximum weight stable set. The title of his talk was “Tree Decompositions with Bounded Independence Number“.
On November 2, 2021, Ben Lund from IBS Discrete Mathematics Group gave a talk on the smallest possible size of a maximal 3-wise intersecting family of subsets of {1,2,…,n} for large n, answering a problem of Erdős and Kleitman proposed in 1974. The title of his talk was “Maximal 3-wise intersecting families“.
On October 26, 2021, Donggyu Kim (김동규) from KAIST & IBS Discrete Mathematics Group gave a talk at the Discrete Math Seminar, introducing 𝝘-graphic delta-matroids and showing their algorithmic applications. The title of his talk was “𝝘-graphic delta-matroids and their applications“.
On October 12, 2021, Joonkyung Lee (이준경) from the Hanyang University gave a talk about the majority dynamics on sparse random graphs. The title of his talk was “Majority dynamics on sparse random graphs“.
On October 8, 2021, Paul Seymour from Princeton University gave an online talk at the Virtual Discrete Math Colloquium on the polynomial 𝜒-boundedness of graph classes. The title of his talk was “Polynomial bounds for chromatic number“.