Reflection positivity, rank connectivity, and homomorphism of graphs
| Authors |
|
|---|---|
| Publication date | 2007 |
| Journal | Journal of the American Mathematical Society |
| Volume | Issue number | 20 |
| Pages (from-to) | 37-51 |
| Organisations |
|
| Abstract | Abstract: 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. |
| Document type | Article |
| Published at |
https://doi.org/10.1090/S0894-0347-06-00529-7
(Final published version)
|
| Published at | |
| Permalink to this page | |