Flipper games for monadically stable graph classes

Jakub Gajarský, Nikolas Mählmann, Rose McCarty +6

A class of graphs $\mathcal{C}$ is monadically stable if for any unary expansion $\hat{\mathcal{C}}$ of $\mathcal{C}$, one cannot interpret, in first-order logic, arbitrarily l…