Image de couverture de livre

Flipper games for monadically stable graph classes

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Gajarský, Jakub, Mählmann, Nikolas, McCarty, Rose, Ohlmann, Pierre, Pilipczuk, Michał, Przybyszewski, Wojciech, Siebertz, Sebastian, Sokołowski, Marek, Toruńczyk, Szymon
Format:	Preprint
Publié:	2023
Sujets:	Logic in Computer Science Discrete Mathematics Data Structures and Algorithms Combinatorics Logic
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Elementary first-order model checking for sparse graphs
par: Gajarský, Jakub, et autres
Publié: (2024)

Separability Properties of Monadically Dependent Graph Classes
par: Bonnet, Édouard, et autres
Publié: (2025)

First-order transducibility among classes of sparse graphs
par: Gajarský, Jakub, et autres
Publié: (2025)

On classes of bounded tree rank, their interpretations, and efficient sparsification
par: Gajarský, Jakub, et autres
Publié: (2024)

Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes
par: Dreier, Jan, et autres
Publié: (2024)

Efficient reversal of transductions of sparse graph classes
par: Dreier, Jan, et autres
Publié: (2026)

Existential Positive Transductions of Sparse Graphs
par: Mählmann, Nikolas, et autres
Publié: (2026)

A Note on Constructive Canonical Splitter Strategies in Nowhere Dense Graph Classes
par: Fuchser, Janne, et autres
Publié: (2025)

3D-grids are not transducible from planar graphs
par: Gajarský, Jakub, et autres
Publié: (2025)

Flipping and Forking
par: Przybyszewski, Wojciech, et autres
Publié: (2025)

Forbidden Induced Subgraphs for Bounded Shrub-Depth and the Expressive Power of MSO
par: Mählmann, Nikolas
Publié: (2025)

Decomposition horizons and a characterization of stable hereditary classes of graphs
par: Braunfeld, Samuel, et autres
Publié: (2022)

Characterizations of monadically dependent tree-ordered weakly sparse structures
par: Buffière, Hector, et autres
Publié: (2026)

Maintaining $\mathsf{CMSO}_2$ properties on dynamic structures with bounded feedback vertex number
par: Majewski, Konrad, et autres
Publié: (2021)

On first-order transductions of classes of graphs
par: Braunfeld, Samuel, et autres
Publié: (2022)

Low rank MSO
par: Bojańczyk, Mikołaj, et autres
Publié: (2025)

Advances in Algorithmic Meta Theorems
par: Siebertz, Sebastian, et autres
Publié: (2024)

Epsilon-saturation for stable graphs and Littlestone classes
par: Malliaris, Maryanthe, et autres
Publié: (2025)

Graph classes through the lens of logic
par: Pilipczuk, Michał
Publié: (2025)

Merge-width and First-Order Model Checking
par: Dreier, Jan, et autres
Publié: (2025)

Flips and Merge-Width in Sparse Graphs
par: Drabik, Karolina, et autres
Publié: (2026)

On the generalized coloring numbers
par: Siebertz, Sebastian
Publié: (2025)

Flip-width: Cops and Robber on dense graphs
par: Toruńczyk, Szymon
Publié: (2023)

On merge-models
par: Buffière, Hector, et autres
Publié: (2026)

Twin-width and permutations
par: Bonnet, Édouard, et autres
Publié: (2021)

Nested Sequents for Intuitionistic Grammar Logics via Structural Refinement
par: Lyon, Tim S.
Publié: (2022)

Logic-based analogical proportions
par: Antić, Christian
Publié: (2024)

Analogical proportions II
par: Antić, Christian
Publié: (2024)

First order complexity of finite random structures
par: Demin, Danila, et autres
Publié: (2024)

First order distinguishability of sparse random graphs
par: Hershko, Tal, et autres
Publié: (2024)

First-order logic axiomatization of metric graph theory
par: Chalopin, Jérémie, et autres
Publié: (2022)

Some remarks on the uncolored versions of the original CFI-graphs
par: Chen, Yijia, et autres
Publié: (2025)

Aggregation of evaluations without unanimity
par: Filmus, Yuval
Publié: (2025)

Foundations for an Abstract Proof Theory in the Context of Horn Rules
par: Lyon, Tim S., et autres
Publié: (2023)

The unstable formula theorem revisited via algorithms
par: Malliaris, Maryanthe, et autres
Publié: (2022)

Lower Bounds on Inverse Cellular Automata via Proof Complexity
par: Kapytka, Maryia
Publié: (2026)

Decidability of Querying First-Order Theories via Countermodels of Finite Width
par: Feller, Thomas, et autres
Publié: (2023)

Agnostic Online Learning and Excellent Sets
par: Malliaris, Maryanthe, et autres
Publié: (2021)

The domino problem is decidable for robust tilesets
par: Aubrun, Nathalie, et autres
Publié: (2024)

Hardness of monadic second-order formulae over succinct graphs
par: Gamard, Guilhem, et autres
Publié: (2023)