On November 19, 2020, Yijia Chen (陈翌佳) from Fudan University spoke at the Virtual Discrete Math Colloquium on the shrub-depth of graph classes. The title of his talk is “Graphs of bounded shrub-depth, through a logic lens“.
Meike Hatzel gave a talk on finding a bramble of small order and small size at the Virtual Discrete Math Colloquium
On November 11, 2020, Meike Hatzel from Technische Universität Berlin gave an online talk on the existence of a bramble of small order and small size in a graph of tree-width k at the Virtual Discrete Math Colloquium. The title of her talk was “Constant congestion bramble“.
Casey Tompkins gave a talk on extremal problems on Boolean and linear lattices with forbidden posets at the Discrete Math Seminar
On November 10, 2020, Casey Tompkins from the IBS Discrete Mathematics Group presented a talk on the extremal problems on Boolean and linear lattices with forbidden posets at the Discrete Math Seminar. The title of his talk was “Extremal forbidden poset problems in Boolean and linear lattices“.
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“.
Jaeseong Oh (오재성) gave a talk on the condition of ribbon graphs sharing the same delta-matroid at the Discrete Math Seminar
On November 3, 2020, Jaeseong Oh (오재성) from Seoul National University presented his work with Iain Moffatt on the characterization of ribbon graphs having the same delta-matroid. The title of his talk is “A 2-isomorphism theorem for delta-matroids“.
Jeong Ok Choi (최정옥) presented a talk on the contagion game and the network creation game on graphs at the Discrete Math Seminar
On October 27, 2020, Jeong Ok Choi (최정옥) from IBS Discrete Mathematics Group / GIST gave a talk on some game-theoretic problems on graphs, more specifically on the contagion game and the network creation game. The title of her talk was “Various game-theoretic models on graphs“.
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
Zihan Tan gave a talk on an improved bound for the grid minor theorem of Robertson and Seymour at the Virtual Discrete Math Colloquium
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