Cover Image

Separability Properties of Monadically Dependent Graph Classes

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bonnet, Édouard, Braunfeld, Samuel, Eleftheriadis, Ioannis, Geniet, Colin, Mählmann, Nikolas, Pilipczuk, Michał, Przybyszewski, Wojciech, Toruńczyk, Szymon
Format:	Preprint
Published:	2025
Subjects:	Combinatorics Discrete Mathematics Logic in Computer Science Logic
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes
by: Dreier, Jan, et al.
Published: (2024)

Flipper games for monadically stable graph classes
by: Gajarský, Jakub, et al.
Published: (2023)

Existential Positive Transductions of Sparse Graphs
by: Mählmann, Nikolas, et al.
Published: (2026)

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

Elementary first-order model checking for sparse graphs
by: Gajarský, Jakub, et al.
Published: (2024)

First-order transducibility among classes of sparse graphs
by: Gajarský, Jakub, et al.
Published: (2025)

Flipping and Forking
by: Przybyszewski, Wojciech, et al.
Published: (2025)

Flips and Merge-Width in Sparse Graphs
by: Drabik, Karolina, et al.
Published: (2026)

A Note on Constructive Canonical Splitter Strategies in Nowhere Dense Graph Classes
by: Fuchser, Janne, et al.
Published: (2025)

First-Order Logic and Twin-Width for Some Geometric Graphs
by: Geniet, Colin, et al.
Published: (2025)

Decomposition horizons and a characterization of stable hereditary classes of graphs
by: Braunfeld, Samuel, et al.
Published: (2022)

On first-order transductions of classes of graphs
by: Braunfeld, Samuel, et al.
Published: (2022)

Merge-width and First-Order Model Checking
by: Dreier, Jan, et al.
Published: (2025)

Transducing Linear Decompositions of Tournaments
by: Geniet, Colin, et al.
Published: (2026)

Graph classes through the lens of logic
by: Pilipczuk, Michał
Published: (2025)

3D-grids are not transducible from planar graphs
by: Gajarský, Jakub, et al.
Published: (2025)

Twin-width and permutations
by: Bonnet, Édouard, et al.
Published: (2021)

Flip-width: Cops and Robber on dense graphs
by: Toruńczyk, Szymon
Published: (2023)

Decidability in geometric grid classes of permutations
by: Braunfeld, Samuel
Published: (2023)

Advances in Algorithmic Meta Theorems
by: Siebertz, Sebastian, et al.
Published: (2024)

Characterizations of monadically dependent tree-ordered weakly sparse structures
by: Buffière, Hector, et al.
Published: (2026)

Epsilon-saturation for stable graphs and Littlestone classes
by: Malliaris, Maryanthe, et al.
Published: (2025)

Variants of Merge-Width and Applications
by: Drabik, Karolina, et al.
Published: (2026)

Monadic Second-Order Logic of Permutations
by: Jelínek, Vít, et al.
Published: (2025)

Aggregation of evaluations without unanimity
by: Filmus, Yuval
Published: (2025)

First order complexity of finite random structures
by: Demin, Danila, et al.
Published: (2024)

Distinguishing Graphs by Counting Homomorphisms from Sparse Graphs
by: Neuen, Daniel, et al.
Published: (2026)

Existential characterizations of monadic NIP
by: Braunfeld, Samuel, et al.
Published: (2022)

Efficient reversal of transductions of sparse graph classes
by: Dreier, Jan, et al.
Published: (2026)

Coarse Balanced Separators in Fat-Minor-Free Graphs
by: Bonnet, Édouard, et al.
Published: (2026)

The unstable formula theorem revisited via algorithms
by: Malliaris, Maryanthe, et al.
Published: (2022)

Agnostic Online Learning and Excellent Sets
by: Malliaris, Maryanthe, et al.
Published: (2021)

The domino problem is decidable for robust tilesets
by: Aubrun, Nathalie, et al.
Published: (2024)

Complexity lower bounds for succinct binary structures of bounded clique-width with restrictions
by: Geniet, Colin, et al.
Published: (2026)

Labelled growth rates of $ω$-categorical structures and applications in choiceless set theory
by: Bodor, Bertalan, et al.
Published: (2025)

On merge-models
by: Buffière, Hector, et al.
Published: (2026)

CNFs and DNFs with Exactly $k$ Solutions
by: Chandran, L. Sunil, et al.
Published: (2025)

First order distinguishability of sparse random graphs
by: Hershko, Tal, et al.
Published: (2024)

An Upper Bound on the Weisfeiler-Leman Dimension
by: Schneider, Thomas, et al.
Published: (2024)

North-East Lattice Paths Avoiding $k$ Collinear Points via Satisfiability
by: Barnoff, Aaron, et al.
Published: (2025)