1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.LO2025
Flipping and Forking
Wojciech Przybyszewski, Szymon Toruńczyk
Monadic stability and the more general monadic dependence (or NIP) are tameness conditions for classes of logical structures, studied in the 80's in Shelah's classification program…
cs.LO2025★ 1 cited
First-order transducibility among classes of sparse graphs
Jakub Gajarský, Jeremi Gładkowski, Jan Jedelský +2
We prove several negative results about first-order transducibility for classes of sparse graphs: - for every , the class of graphs of treewidth at most is…
math.CO2025
Separability Properties of Monadically Dependent Graph Classes
Édouard Bonnet, Samuel Braunfeld, Ioannis Eleftheriadis +5
A graph class is monadically dependent if one cannot interpret all graphs in colored graphs from using a fixed first-order interpretation. We prove that m…