Graph operations and upper bounds on graph homomorphism counts

摘要

We construct a family of countexamples to a conjecture of Galvin [5], which stated that for any n-vertex, d-regular graph G and any graph H (possibly with loops),