1 paper · 1 filter
Anuj Dawar
We construct a pair of non-isomorphic, bipartite graphs which are not distinguished by counting the number of homomorphisms to any tree. This answers a question motivated by Atseri…