Strongly Polynomial Sequences as Interpretations

A strongly polynomial sequence of graphs (Gn) is a sequence (Gn)n∈N of finite graphs such that, for every graph F, the number of homomor-phisms from F to Gn is a fixed polynomial function of n (depending on F). For example, (Kn) is strongly polynomial since the number of ho-momorphisms from F to Kn is the chromatic polynomial of F evaluated at n. In earlier work of de la Harpe and Jaeger, and more recently o