The Complexity of Homomorphism Reconstruction Revisited

Timo Gervens, Martin Grohe, Louis Härtel +1

We revisit the algorithmic problem of reconstructing a graph from homomorphism counts that has first been studied in (Böker et al., STACS 2024): given graphs $F_1,\dots ,F_k$ and…