We prove a general theorem on semigroup functions that implies characterizations of graph partition functions in terms of the positive semidefiniteness ('reflection positivity') and rank of certain derived matrices. The theorem can be applied to undirected and directed graphs as well as hypergraphs.
['László Lovász', 'Alexander Schrijver']
Graph parameters and semigroup functions