Answers are grounded in this paper and cite their sources.
It is shown that a graph parameter can be realized as the number of homomorphisms into a fixed (weighted) graph if and only if it satisfies two linear algebraic conditions: reflection positivity and exponential rank connectivity. In terms of statistical physics, this can be viewed as a characterization of partition functions of vertex coloring models.
No takes yet. Share an insight, caveat, or question.
Freedman et al. (2006) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: