Maximising $H$-Colourings of Graphs

Hannah Guggiari, Alex Scott

For graphs $G$ and $H$, an $H$-colouring of $G$ is a map $\psi :V(G)\to V(H)$ such that $ij\in E(G)\Rightarrow \psi (i)\psi (j)\in E(H)$. The number of $H$-colourings of $G$ is denoted…