기초과학연구원 이산수학그룹
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 19, 2021, Jinha Kim (김진하) of the IBS Discrete Mathematics Group received the Excellence Award for Young Scientist (미래인재상) by Korea Federation of Women’s Science and Technology Associations (KOFWST, 한국여성과학기술단체총연합회). This award was created to recognize woman scientists and engineers who have the potentials to elevate the nation’s competitiveness in science through great passion, dedication, and remarkable achievement in their work. Congratulations!
The IBS Discrete Mathematics Group had its second “DIMAG Internal Workshop” at the St. Johns Hotel of Gangneung on November 15-17, 2021. Participants include almost all current members of DIMAG, Cheolwon Heo from Sungkyunkwan University, and Semin Yoo from KIAS. Every participant presented open problems informally.
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“.