| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4654388 | European Journal of Combinatorics | 2008 | 16 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
László Lovász, Alexander Schrijver,