Daniel Cranston gave a talk on partitioning the vertex set of a graph into an edge-less graph and a forest consisting of small components at the Virtual Discrete Math Colloquium

On November 5, 2020, Daniel Cranston from Virginia Commonwealth University gave a talk on the condition of the maximum average degree for a graph to have a partition of its vertex set into an independent set and a set inducing a forest consisting of components of small size at the Virtual Discrete Math Colloquium. The title of his talk was “Vertex Partitions into an Independent Set and a Forest with Each Component Small“.

Chun-Hung Liu (劉俊宏) gave a talk on his recent results on the asymptotic dimension of families of various graph classes at the Virtual Discrete Math Colloquium

On October 22, 2020, Chun-Hung Liu (劉俊宏) from Texas A&M University gave a talk on his recent work answering several open problems on the asymptotic dimension of several graph classes at the Virtual Discrete Math Colloquium. The title of his talk was “Asymptotic dimension of minor-closed families and beyond“.

Joonkyung Lee (이준경) gave a talk on norms defined from graphs at the Discrete Math Seminar

On October 21, 2020, Joonkyung Lee (이준경) from University College London gave a talk at the Discrete Math Seminar on norms defined from graphs motivated by Sidorenko’s conjecture and Gowers norms on extremal combinatorics, unifying two seemingly different concepts of real-norming graphs and complex-norming graphs. The title of his talk was “On graph norms for complex-valued functions“. Joonkyung Lee will stay at the IBS discrete mathematics group for several weeks from October 19.

Minki Kim (김민기) gave a talk on the collapsibility of the complex of vertex sets not containing independent sets of fixed size at the Discrete Math Seminar

On September 29, 2020, Minki Kim (김민기) from the IBS Discrete Mathematics Group presented his work on the collapsibility of the complex In(G) of vertex sets of a graph G not containing any n-vertex independent set at the Discrete Math Seminar. The title of his talk was “Complexes of graphs with bounded independence number“.

Zihan Tan gave a talk on an improved bound for the grid minor theorem of Robertson and Seymour at the Virtual Discrete Math Colloquium

crossbar

On September 24, 2020, Zihan Tan from University of Chicago gave an online talk about his recent work with Julia Chuzhoy on an improved bound for the grid minor theorem of Robertson and Seymour. They prove that every graph with no g×g grid minor has tree-width at most O(g9polylog(g)). The title of his talk was “Towards Tight(er) Bounds for the Excluded Grid Theorem“.

IBS 이산수학그룹 Discrete Mathematics Group
기초과학연구원 수리및계산과학연구단 이산수학그룹
대전 유성구 엑스포로 55 (우) 34126
IBS Discrete Mathematics Group (DIMAG)
Institute for Basic Science (IBS)
55 Expo-ro Yuseong-gu Daejeon 34126 South Korea
E-mail: dimag@ibs.re.kr, Fax: +82-42-878-9209
Copyright © IBS 2018. All rights reserved.