Home » News » seminar » 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

September 12, 2020September 12, 2020 by DIMAG

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“.

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

Chuandong Xu (徐川东)

Niloufar Fuladi

Magnus Wahlström