Graph Homomorphism Polynomials: Algorithms and Complexity

Balagopal Komarath, Anurag Pandey, C. S. Rahul

We study homomorphism polynomials, which are polynomials that enumerate all homomorphisms from a pattern graph $H$ to $n$-vertex graphs. These polynomials have received a lot of at…