5 citations · 15 across the 12 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.LO2023
Canonical decompositions in monadically stable and bounded shrubdepth graph classes
Pierre Ohlmann, Michał Pilipczul, Szymon Toruńczyk +1
We use model-theoretic tools originating from stability theory to derive a result we call the Finitary Substitute Lemma, which intuitively says the following. Suppose we work in a…
cs.LO2023
Flipper games for monadically stable graph classes
Jakub Gajarský, Nikolas Mählmann, Rose McCarty +6
A class of graphs is monadically stable if for any unary expansion of , one cannot interpret, in first-order logic, arbitrarily l…