Counting Bounded Tree Depth Homomorphisms

03/18/2020
by   Martin Grohe, et al.
0

We prove that graphs G, G' satisfy the same sentences of first-order logic with counting of quantifier rank at most k if and only if they are homomorphism-indistinguishable over the class of all graphs of tree depth at most k. Here G, G' are homomorphism-indistinguishable over a class C of graphs if for each graph F in C, the number of homomorphisms from F to G equals the number of homomorphisms from F to G'.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/20/2023

Counting Homomorphisms from Hypergraphs of Bounded Generalised Hypertree Width: A Logical Characterisation

We introduce the 2-sorted counting logic GC^k that expresses properties ...
research
08/11/2023

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

We study the expressive power of first-order logic with counting quantif...
research
11/01/2019

Obstructions for bounded shrub-depth and rank-depth

Shrub-depth and rank-depth are dense analogues of the tree-depth of a gr...
research
12/31/2020

Automatic Historical Feature Generation through Tree-based Method in Ads Prediction

Historical features are important in ads click-through rate (CTR) predic...
research
10/11/2022

Descriptive complexity of the generalized spectra of graphs

Two graphs are cospectral if their respective adjacency matrices have th...
research
10/21/2021

Polyadic Sets and Homomorphism Counting

A classical result due to Lovasz (1967) shows that the isomorphism type ...
research
07/04/2019

The Complexity of Approximately Counting Retractions to Square-Free Graphs

A retraction is a homomorphism from a graph G to an induced subgraph H o...

Please sign up or login with your details

Forgot password? Click here to reset