1 citations · 1 across the 3 of their papers we have counts for
3 papers
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
Obstructions and dualities for matroid depth parameters
Jakub Gajarský, Kristýna Pekárková, Michał Pilipczuk
Contraction-depth is considered to be one of the analogues of graph tree-depth in the matroid setting. In this paper, we investigate structural properties of contraction-de…
cs.LO2025
3D-grids are not transducible from planar graphs
Jakub Gajarský, Michał Pilipczuk, Filip Pokrývka
We prove that the class of 3D-grids is cannot be transduced from planar graphs, and more generally, from any class of graphs of bounded Euler genus. To prove our result, we introdu…