Fetching the paper…
Reading the bibliography…
Two graphs $G$ and $H$ are homomorphism indistinguishable over a class of graphs $\mathcal{F}$ if for all graphs $F \in \mathcal{F}$ the number of homomorphisms from $F$ to $G$ is equal to the number of homomorphisms from $F$ to $H$.
Beweis einer Abschwächung der Hadwiger-Vermutung
K. Wagner · 1964
Earlier work this paper cites.
Operations with structures
László Lovász · 1967
Earlier work this paper cites.
On the cancellation law among finite relational structures
László Lovász · 1971
Earlier work this paper cites.
The chromatic number and other functions of the lexicographic product
Dennis Geller and Saul Stahl · 1975
Earlier work this paper cites.
Graph minors. V. Excluding a planar graph
Neil Robertson and P.D Seymour · 1986
Earlier work this paper cites.
An optimal lower bound on the number of variables for graph identification
Jin-Yi Cai, Martin Fürer, and Neil Immerman · 1992
Earlier work this paper cites.
Optimization of Real Conjunctive Queries
Surajit Chaudhuri and Moshe Y. Vardi · 1993
Earlier work this paper cites.
The monadic second order logic of graphs VI: on several representations of graphs by relational structures
Bruno Courcelle · 1994
Earlier work this paper cites.
Logical Hierarchies in PTIME
Lauri Hella · 1996
Earlier work this paper cites.
Network motifs: simple building blocks of complex networks
Ron Milo, Shai Shen-Orr, Shalev Itzkovitz, Nadav Kashtan, Dmitri Chklovskii, and Uri Alon · 2002
Earlier work this paper cites.
Reflection positivity, rank connectivity, and homomorphism of graphs
Michael Freedman, László Lovász, and Alexander Schrijver · 2007
Earlier work this paper cites.
Biomolecular network motif counting and discovery by color coding
Noga Alon, Phuong Dao, Iman Hajirasouliha, Fereydoun Hormozdiari, and Süleyman Cenk Sahinalp · 2008
Earlier work this paper cites.
Semidefinite Functions on Categories
László Lovász and Alexander Schrijver · 2009
Earlier work this paper cites.
On recognizing graphs by numbers of homomorphisms
Zdeněk Dvořák · 2010
Earlier work this paper cites.
The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey
Thomas Eiter, Georg Gottlob, and Thomas Schwentick · 2010
Cited alongside, same era.
Large networks and graph limits
László Lovász · 2012
Cited alongside, same era.
Sparsity: Graphs, Structures, and Algorithms
Jaroslav Nešetřil and Patrice Ossona de Mendez · 2012
Cited alongside, same era.
Graph isomorphism in quasipolynomial time [extended abstract]
László Babai · 2016
Cited alongside, same era.
Hadwiger’s Conjecture
Paul Seymour · 2016
Cited alongside, same era.
Polymorphisms, and How to Use Them
Libor Barto, Andrei Krokhin, and Ross Willard · 2017
Cited alongside, same era.
Homomorphisms Are a Good Basis for Counting Small Subgraphs
A survey on graph kernels
Nils M. Kriege, Fredrik D. Johansson, and Christopher Morris · 2020
Later among the works it cites.
Quantum isomorphism is equivalent to equality of homomorphism counts from planar graphs
Laura Mančinska and David E. Roberson · 2020
Later among the works it cites.
Graph homomorphism convolution
Hoang Nguyen and Takanori Maehara · 2020
Later among the works it cites.
On the Expressive Power of Homomorphism Counts
Albert Atserias, Phokion G. Kolaitis, and Wei-Lin Wu · 2021
Later among the works it cites.
Lovász-Type Theorems and Game Comonads
Anuj Dawar, Tomáš Jakl, and Luca Reggio · 2021
Later among the works it cites.
Discrete density comonads and graph parameters
Samson Abramsky, Tomáš Jakl, and Thomas Paine · 2022
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Radu Curticapean, Holger Dell, and Dániel Marx · 2017
Cited alongside, same era.
Extended logics: The general framework
H.-D. Ebbinghaus · 2017
Cited alongside, same era.
Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
Martin Grohe · 2017
Cited alongside, same era.
Quantum and non-signalling graph isomorphisms
Albert Atserias, Laura Mančinska, David E. Roberson, Robert Šámal, Simone Severini, and Antonios Varvitsiotis · 2018
Cited alongside, same era.
Lovász Meets Weisfeiler and Leman
Holger Dell, Martin Grohe, and Gaurav Rattan · 2018
Cited alongside, same era.
The Complexity of Homomorphism Indistinguishability
Jan Böker, Yijia Chen, Martin Grohe, and Gaurav Rattan · 2019
Cited alongside, same era.
On algorithms based on finitely many homomorphism counts
Yijia Chen, Jörg Flum, Mingjun Liu, and Zhiyang Xun · 2022
Later among the works it cites.
Determinacy of Real Conjunctive Queries. The Boolean Case
Jarosław Kwiecień, Jerzy Marcinkowski, and Piotr Ostropolski-Nalewaja · 2022
Later among the works it cites.
The Pebble-Relation Comonad in Finite Model Theory
Yoàv Montacute and Nihil Shah · 2022
Later among the works it cites.
Oddomorphisms and homomorphism indistinguishability over graphs of bounded degree, June 2022
David E. Roberson · 2022
Later among the works it cites.
Homomorphism-Distinguishing Closedness for Graphs of Bounded Tree-Width, April 2023
Daniel Neuen · 2023
Closest in time.
Weisfeiler–Leman and Graph Spectra
Gaurav Rattan and Tim Seppelt · 2023
Closest in time.
Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability
David E. Roberson and Tim Seppelt · 2023
Closest in time.
Logical Equivalences, Homomorphism Indistinguishability, and Forbidden Minors
Tim Seppelt · 2023
Closest in time.