Going Deep and Going Wide: Counting Logic and Homomorphism Indistinguishability over Graphs of Bounded Treedepth and Treewidth

Abstract

We study the expressive power of first-order logic with counting quantifiers, especially the $k$-variable and quantifier-rank-$q$ fragment ${\mathsf{C}}_q^k$, using homomorphism indistinguishability. Recently, Dawar, Jakl, and Reggio (2021) proved that two graphs satisfy the same ${\mathsf{C}}_q^k$-sentences if and only if they are homomorphism indistinguishable over the class ${\mathcal{T}}_q^k$ of graphs admitting a $k$-pebble forest cover of depth $q$. Their proof builds on the categorical framework of game comonads developed by Abramsky, Dawar, and Wang (2017). We reprove their result using elementary techniques inspired by Dvořák (2010). Using these techniques we also give a characterisation of guarded counting logic. Our main focus, however, is to provide a graph theoretic analysis of the graph class ${\mathcal{T}}_q^k$. This allows us to separate ${\mathcal{T}}_q^k$ from the intersection of the graph class ${\mathcal{T}\mathcal{W}}_{k-1}$, that is graphs of treewidth less or equal $k-1$, and ${\mathcal{T}\mathcal{D}}_q$, that is graphs of treedepth at most $q$ if $q$ is sufficiently larger than $k$. We are able to lift this separation to the semantic separation of the respective homomorphism indistinguishability relations. A part of this separation is to prove that the class ${\mathcal{T}\mathcal{D}}_q$ is homomorphism distinguishing closed, which was already conjectured by Roberson (2022).

30 pages, 3 figures