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 $I_n(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\times g$ grid minor has tree-width at most $O(g^{9}\operatorname{poly log}(g))$. The title of his talk was “Towards Tight(er) Bounds for the Excluded Grid Theorem“.

Jinha Kim (김진하) gave a talk on her work on the collapsibility of the non-cover complexes of graphs at the Discrete Math Seminar

On September 22, 2020, Jinha Kim (김진하) from the IBS Discrete Mathematics Group presented her recent work on the collapsibility of the non-cover complexes of graphs at the Discrete Math Seminar. The non-cover complex of a graph is a simplical complex consisting of subsets of vertices not covering all edges. The title of her talk was “Collapsibility of Non-Cover Complexes of Graphs“.

Debsoumya Chakraborti gave a talk on the problem of maximizing the number of cliques in a graph of small maximum degree at the Discrete Math Seminar

On September 15, 2020, Debsoumya Chakraborti from the IBS Discrete Mathematics Group presented a talk on the extremal problem on the number of cliques in a graph of small maximum degree with a fixed number of edges. The title of his talk was “Maximum number of cliques in a graph with bounded maximum degree“.

Sebastian Siebertz gave a talk on recent approaches to combine model theoretic and graph theoretic tools to derive structural and algorithmic results for classes of (finite) graphs at the Virtual Discrete Math Colloquium

On September 10, 2020, Sebastian Siebertz from University of Bremen gave an online talk about recent attempts to combine the model theory to the theory of dense graphs at the Virtual Discrete Math Colloquium. The title of his talk was “Rank-width meets stability“.

Junguk Lee (이정욱) from KAIST gave an intensive lecture on the stability and NIP in the model theory at the Discrete Math Seminar for two days

On August 31 and September 1, 2020, Junguk Lee (이정욱) from KAIST gave a 6-hour-long talk on the model theory with the focus on the stability, NIP, and the VC dimension at the Discrete Math Seminar. The title of his talk was “a quick introduction to stability and NIP”. The part 1 “basics” and the part 2 “stability” were coved on August 31, for 1.5 hours each, and the part 3 “NIP” was covered on September 1 for 3 hours (10:30-11:30, 3:00-4:00, 4:10-5:10).