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...
share
research
∙
08/10/2023
Limitations of Game Comonads via Homomorphism Indistinguishability
Abramsky, Dawar, and Wang (2017) introduced the pebbling comonad for k-v...
research
∙
02/22/2023
Logical Equivalences, Homomorphism Indistinguishability, and Forbidden Minors
Two graphs G and H are homomorphism indistinguishable over a class of gr...
research
∙
02/21/2023
Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability
We show that feasibility of the t^th level of the Lasserre semidefinite ...
research
∙
11/22/2021
Homomorphism Tensors and Linear Equations
Lovász (1967) showed that two graphs G and H are isomorphic if and only ...
research
∙
03/04/2021
Weisfeiler–Leman, Graph Spectra, and Random Walks
The Weisfeiler–Leman algorithm is a ubiquitous tool for the Graph Isomor...
research
∙
09/23/2019