Separability properties of monadically dependent graph classes

DOI10.4230/LIPICS.ICALP.2025.147MaRDI QIDQ7397606zbMATH OpenFDO

Authors Édouard Bonnet, Samuel Braunfeld, Ioannis Eleftheriadis, Colin Geniet, Michał Pilipczuk, Wojciech Przybyszewski, Szymon Toruńczyk

Publication date 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2025.147

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites work

• A combinatorial problem; stability and order for models and theories in infinitary languages
• Applications of a Planar Separator Theorem
• Canonical decompositions in monadically stable and bounded shrubdepth graph classes
• Existence of modeling limits for sequences of sparse structures
• Flip-width: cops and robber on dense graphs
• Flipper games for monadically stable graph classes
• scientific article; zbMATH DE number 3819693 (Why is no real title available?)
• Indiscernibles and flatness in monadically stable and monadically NIP classes
• Intersection Theorems for Systems of Sets
• Model checking on interpretations of classes of bounded local cliquewidth
• On nowhere dense graphs
• On the density of families of sets
• Second-order quantifiers and the complexity of theories
• Sparsity. Graphs, structures, and algorithms
• Structural sparsity

This page was built for publication: Separability properties of monadically dependent graph classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7397606)