1 problem

Let $Hom(F,G)$ denote the number of graph homomorphisms from $F$ to $G$, and let $\mathcal{G}$ be the family of all graphs. For a family of graphs $\mathcal{F}$, say that…