2 problems

Let $\mathcal{P}$ denote the class of paths, let $\mathcal{T}_n$ denote the class of rooted trees of height at most $n$, and let $\sqsupseteq_\mathrm{FO}$ denote the first-order tr…

Let $\mathcal{C}$ be a class of graphs, let $\mathcal{P}$ denote the class of paths, and let $\sqsupseteq_\mathrm{FO}$ denote the first-order transduction quasiorder. A graph class…