Cover Image

Decomposing graphs into stable and ordered parts

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Buffière, Hector, de Mendez, Patrice Ossona
Format:	Preprint
Published:	2025
Subjects:	Combinatorics Logic in Computer Science Logic
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

Modeling FO-limits for monadically stable sequences
by: Braunfeld, S., et al.
Published: (2025)

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

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

A very sharp threshold for first order logic distinguishability of random graphs
by: Benjamini, Itai, et al.
Published: (2022)

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

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

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

Indivisibility and uniform computational strength
by: Gill, Kenneth
Published: (2023)

Decidability for Sturmian words
by: Hieronymi, Philipp, et al.
Published: (2021)

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

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

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

First-order logic axiomatization of metric graph theory
by: Chalopin, Jérémie, et al.
Published: (2022)

Decomposable shuffles
by: Dias, João, et al.
Published: (2026)

On the cartesian product of well-orderings
by: Vialard, Isa
Published: (2022)

Separability Properties of Monadically Dependent Graph Classes
by: Bonnet, Édouard, et al.
Published: (2025)

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

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

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

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

Local and global $d$-rigidity are not definable in the first order logic of graphs
by: Bernstein, Daniel Irving, et al.
Published: (2025)

Tutte's theorem as an educational formalization project
by: Otte, Pim
Published: (2025)

Convergence Laws for Extensions of First-Order Logic with Averaging
by: Adam-Day, Sam, et al.
Published: (2025)

Further Comments on Yablo's Construction
by: Schlechta, Karl
Published: (2025)

Additive systems for $\mathbb{Z}$ are undecidable
by: Zabolotskii, Andrei
Published: (2025)

Transductions of Graph Classes Admitting Product Structure
by: Hliněný, Petr, et al.
Published: (2025)

Composition Direction of Seymour's Theorem for Regular Matroids -- Formally Verified
by: Dvorak, Martin, et al.
Published: (2025)

Two variable logic with ultimately periodic counting
by: Benedikt, Michael, et al.
Published: (2020)

Local structure of idempotent algebras II
by: Bulatov, Andrei A.
Published: (2020)

On Planarity of Graphs in Homotopy Type Theory
by: Prieto-Cubides, Jonathan, et al.
Published: (2021)

Bijections between planar maps and planar linear normal $λ$-terms with connectivity condition
by: Fang, Wenjie
Published: (2022)

A Formal Proof of R(4,5)=25
by: Gauthier, Thibault, et al.
Published: (2024)

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

Some remarks on the uncolored versions of the original CFI-graphs
by: Chen, Yijia, et al.
Published: (2025)

An order-theoretic circuit syntax and characterisation of the concept lattice
by: van der Lugt, Tein
Published: (2025)

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