scientific article; zbMATH DE number 7559449

DOI10.4230/LIPIcs.MFCS.2020.78MaRDI QIDQ5089253

Adam Paszke, Michał Pilipczuk

Publication date: 18 July 2022

Full work available at URL: https://arxiv.org/abs/2003.14177

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

treewidthcliquewidthdefinable setsvapnik-chervonenkis density

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items

Neighbourhood complexity of graphs of bounded twin-width

Cites Work

• Unnamed Item
• Unnamed Item
• Learnability and definability in trees and similar structures
• The structure of the models of decidable monadic theories of graphs
• Vertex-minors, monadic second-order logic, and a conjecture by Seese
• Graph minors. V. Excluding a planar graph
• Monadic second-order definable graph transductions: a survey
• Logical description of context-free graph languages
• Fly-automata for checking \(\mathrm{MSO}_2\) graph properties
• Upper bounds to the clique width of graphs
• From tree-decompositions to clique-width terms
• A combinatorial problem; stability and order for models and theories in infinitary languages
• On the density of families of sets
• On the number of types in sparse graphs
• Decidability of Second-Order Theories and Automata on Infinite Trees