On Algorithms Based on Finitely Many Homomorphism Counts

Yijia Chen, Jörg Flum, Mingjun Liu +1

It is well known [Lovász, 67] that up to isomorphism a graph~$G$ is determined by the homomorphism counts $\mathrm{hom}(F,G)$, i.e., the number of homomorphisms from $F$ to $G$, where $F$…