DeepAI

# On the Expressive Power of Homomorphism Counts

A classical result by Lovász asserts that two graphs G and H are isomorphic if and only if they have the same left-homomorphism vector, that is, for every graph F, the number of homomorphisms from F to G coincides with the number of homomorphisms from F to H. Dell, Grohe, and Rattan showed that restrictions of the left-homomorphism vector to a class of graphs can capture several different relaxations of isomorphism, including co-spectrality (i.e., two graphs having the same characteristic polynomial), fractional isomorphism and, more broadly, equivalence in counting logics with a fixed number of variables. On the other side, a result by Chaudhuri and Vardi asserts that isomorphism is also captured by the right-homomorphism vector, that is, two graphs G and H are isomorphic if and only if for every graph F, the number of homomorphisms from G to F coincides with the number of homomorphisms from H to F. In this paper, we embark on a study of the restrictions of the right-homomorphism vector by investigating relaxations of isomorphism that can or cannot be captured by restricting the right-homomorphism vector to a fixed class of graphs. Our results unveil striking differences between the expressive power of the left-homomorphism vector and the right-homomorphism vector. We show that co-spectrality, fractional isomorphism, and equivalence in counting logics with a fixed number of variables cannot be captured by restricting the right-homomorphism vector to a class of graphs. In the opposite direction, we show that chromatic equivalence cannot be captured by restricting the left-homomorphism vector to a class of graphs, while, clearly, it can be captured by restricting the right-homomorphism vector to the class of all cliques.

• 14 publications
• 11 publications
• 1 publication
02/18/2019

### Approximations of Isomorphism and Logics with Linear-Algebraic Operators

Invertible map equivalences are approximations of graph isomorphism that...
11/09/2018

### On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties

We investigate graph properties and parameters that are invariant under ...
03/18/2020

### Counting Bounded Tree Depth Homomorphisms

We prove that graphs G, G' satisfy the same sentences of first-order log...
06/14/2022

### Counting Markov Equivalent Directed Acyclic Graphs Consistent with Background Knowledge

A polynomial-time exact algorithm for counting the number of directed ac...
10/24/2019

### On the Weisfeiler-Leman Dimension of Fractional Packing

The k-dimensional Weisfeiler-Leman procedure (k-WL), which colors k-tupl...
10/11/2022

### Descriptive complexity of the generalized spectra of graphs

Two graphs are cospectral if their respective adjacency matrices have th...
10/15/2022

### LAD: A Hybrid Deep Learning System for Benign Paroxysmal Positional Vertigo Disorders Diagnostic

Herein, we introduce "Look and Diagnose" (LAD), a hybrid deep learning-b...