Flipper games for monadically stable graph classes

01/31/2023
โˆ™
by   Jakub Gajarsky, et al.
โˆ™
0
โˆ™

A class of graphs ๐’ž is monadically stable if for any unary expansion ๐’ž of ๐’ž, one cannot interpret, in first-order logic, arbitrarily long linear orders in graphs from ๐’ž. It is known that nowhere dense graph classes are monadically stable; these encompass most of the studied concepts of sparsity in graphs, including graph classes that exclude a fixed topological minor. On the other hand, monadic stability is a property expressed in purely model-theoretic terms and hence it is also suited for capturing structure in dense graphs. For several years, it has been suspected that one can create a structure theory for monadically stable graph classes that mirrors the theory of nowhere dense graph classes in the dense setting. In this work we provide a step in this direction by giving a characterization of monadic stability through the Flipper game: a game on a graph played by Flipper, who in each round can complement the edge relation between any pair of vertex subsets, and Connector, who in each round localizes the game to a ball of bounded radius. This is an analog of the Splitter game, which characterizes nowhere dense classes of graphs (Grohe, Kreutzer, and Siebertz, J.ACM'17). We give two different proofs of our main result. The first proof uses tools from model theory, and it exposes an additional property of monadically stable graph classes that is close in spirit to definability of types. Also, as a byproduct, we give an alternative proof of the recent result of Braunfeld and Laskowski (arXiv 2209.05120) that monadic stability for graph classes coincides with existential monadic stability. The second proof relies on the recently introduced notion of flip-wideness (Dreier, Mรคhlmann, Siebertz, and Toruล„czyk, arXiv 2206.13765) and provides an efficient algorithm to compute Flipper's moves in a winning strategy.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
โˆ™ 03/02/2023

Canonical decompositions in monadically stable and bounded shrubdepth graph classes

We use model-theoretic tools originating from stability theory to derive...
research
โˆ™ 07/15/2020

Rankwidth meets stability

We study two notions of being well-structured for classes of graphs that...
research
โˆ™ 06/29/2022

Combinatorial and Algorithmic Aspects of Monadic Stability

Nowhere dense classes of graphs are classes of sparse graphs with rich s...
research
โˆ™ 06/28/2022

Indiscernibles and Wideness in Monadically Stable and Monadically NIP Classes

An indiscernible sequence (aฬ…_i)_1โ‰ค iโ‰ค n in a structure is an ordered se...
research
โˆ™ 10/10/2019

Representing All Stable Matchings by Walking a Maximal Chain

The seminal book of Gusfield and Irving [GI89] provides a compact and al...
research
โˆ™ 09/15/2019

Nowhere dense graph classes and algorithmic applications. A tutorial at Highlights of Logic, Games and Automata 2019

The notion of nowhere dense graph classes was introduced by Neลกetล™il and...
research
โˆ™ 02/07/2023

First-Order Model Checking on Structurally Sparse Graph Classes

A class of graphs is structurally nowhere dense if it can be constructed...

Please sign up or login with your details

Forgot password? Click here to reset