Long paths need not minimize $H$-colorings among trees

David Galvin, Emily McMillon, JD Nir +1

Given a graph $G$ and a target graph $H$, an $H$-coloring of $G$ is an adjacency-preserving vertex map from $G$ to $H$. By appropriate choice of $H$, these colorings can express, f…