The Complexity of Approximately Counting Retractions

Jacob Focke, Leslie Ann Goldberg, Stanislav Zivny

Let $G$ be a graph that contains an induced subgraph $H$. A retraction from $G$ to $H$ is a homomorphism from $G$ to $H$ that is the identity function on $H$. Retractions are very…