Fetching the paper…
Reading the bibliography…
Graph homomorphism has been an important research topic since its introduction [17].
Perfect matchings, rank of connection tensors and graph homomorphisms
J.-Y. Cai and A. Govorov · 1909
Earlier work this paper cites.
On a theorem of Lovász that hom ( ⋅ , H ) \hom(\cdot,{H}) determines the isomorphism type of H {H}
J.-Y. Cai and A. Govorov · 1909
Earlier work this paper cites.
Operations with structures
L. Lovász · 1967
Earlier work this paper cites.
An optimal lower bound on the number of variables for graph identifications
J.-Y. Cai, M. Fürer, and N. Immerman · 1992
Earlier work this paper cites.
The complexity of counting graph homomorphisms
M. E. Dyer and C. S. Greenhill · 2000
Earlier work this paper cites.
The complexity of partition functions
A. Bulatov and M. Grohe · 2004
Earlier work this paper cites.
Corrigendum: The complexity of counting graph homomorphisms
M. E. Dyer and C. S. Greenhill · 2004
Earlier work this paper cites.
Graphs and homomorphisms
P. Hell and J. Nešetřil · 2004
Earlier work this paper cites.
The rank of connection matrices and the dimension of graph algebras
L. Lovász · 2006
Earlier work this paper cites.
On counting homomorphisms to directed acyclic graphs
M. E. Dyer, L. A. Goldberg, and M. Paterson · 2007
Cited alongside, same era.
Reflection positivity, rank connectivity, and homomorphism of graphs
M. Freedman, L. Lovász, and A. Schrijver · 2007
Cited alongside, same era.
Edge coloring models and reflection positivity
B. Szegedy · 2007
Cited alongside, same era.
Convergent sequences of dense graphs I: Subgraph frequencies, metric properties and testing
C. Borgs, J. T. Chayes, L. Lovász, V. T. Sós, and K. Vesztergombi · 2008
Cited alongside, same era.
Generalized quasirandom graphs
L. Lovász and V. T. Sós · 2008
Cited alongside, same era.
Contractors and connectors of graph algebras
L. Lovász and B. Szegedy · 2009
Cited alongside, same era.
Counting homomorphisms and partition functions
M. Grohe and M. Thurley · 2011
Later among the works it cites.
Graph homomorphisms with complex values: A dichotomy theorem
J.-Y. Cai, X. Chen, and P. Lu · 2013
Later among the works it cites.
On the dimension of graph algebras for homomorphism functions, 2013
L. Lovász · 2013
Later among the works it cites.
Graph Parameters and Invariants of the Orthogonal Group
G. Regts · 2013
Later among the works it cites.
Characterizing partition functions of the spin model by rank growth
A. Schrijver · 2013
Later among the works it cites.
Matroid invariants and counting graph homomorphisms
A. Goodall, G. Regts, and L. Vena · 2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Graph invariants in the spin model
A. Schrijver · 2009
Cited alongside, same era.
The Complexity of Partition Functions
M. Thurley · 2009
Cited alongside, same era.
A complexity dichotomy for partition functions with mixed signs
L. A. Goldberg, M. Grohe, M. Jerrum, and M. Thurley · 2010
Cited alongside, same era.
Lovász meets Weisfeiler and Leman
H. Dell, M. Grohe, and G. Rattan · 2018
Later among the works it cites.
A decidable dichotomy theorem on directed graph homomorphisms with non-negative weights
J.-Y. Cai and X. Chen · 2019
Closest in time.