Transducing paths in graph classes with unbounded shrubdepth
share
Transductions are a general formalism for expressing transformations of graphs (and more generally, of relational structures) in logic. We prove that a graph class ๐ can be ๐ฅ๐ฎ-transduced from a class of bounded-height trees (that is, has bounded shrubdepth) if, and only if, from ๐ one cannot ๐ฅ๐ฎ-transduce the class of all paths. This establishes one of the three remaining open questions posed by Blumensath and Courcelle about the ๐ฌ๐ฒ๐ฎ-transduction quasi-order, even in the stronger form that concerns ๐ฅ๐ฎ-transductions instead of ๐ฌ๐ฒ๐ฎ-transductions. The backbone of our proof is a graph-theoretic statement that says the following: If a graph G excludes a path, the bipartite complement of a path, and a half-graph as semi-induced subgraphs, then the vertex set of G can be partitioned into a bounded number of parts so that every part induces a cograph of bounded height, and every pair of parts semi-induce a bi-cograph of bounded height. This statement may be of independent interest; for instance, it implies that the graphs in question form a class that is linearly ฯ-bounded.
READ FULL TEXT
