• Mamadou Moustapha Kanté, MSOL-Definable decompositions

    Room B332 IBS (기초과학연구원)

    I will first introduce the notion of recognisability of languages of terms and then its extensions to sets of relational structures. In a second step, I will discuss relations with decompositions of graphs/matroids and why their MSOL-definability is related to understanding recognisable sets. I will finally explain  how to define in MSOL branch-decompositions for finitely

  • Mamadou Moustapha Kanté, Strongly flip-flat classes of graphs

    Room B332 IBS (기초과학연구원)

    Strong flip-flatness appears to be the analogue of uniform almost-wideness in the setting of dense classes of graphs. Almost-wideness is a notion that was central in different characterisations of nowhere dense classes of graphs, and in particular the game-theoretic one. In this talk I will present the flip-flatness notions and conjectures about the characterization of