The Complexity of Approximately Counting Retractions to Square-Free Graphs

Jacob Focke, Leslie Ann Goldberg, Stanislav Živný

A retraction is a homomorphism from a graph $G$ to an induced subgraph $H$ of $G$ that is the identity on $H$. In a long line of research, retractions have been studied under vario…