| Title | Reflection positivity, rank connectivity, and homomorphism of graphs |
|---|---|
| Published in | Journal of the American Mathematical Society, Vol. 20, p.37-51. ISSN 08940347. |
| Author | Freedman, M.H.; Lovász, L.; Schrijver, A. |
| Date | 2007 |
| Type | article |
| 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. |
| Publication | http://dare.uva.nl/record/286962 |
| OpenURL | Search this publication in (your) library |
| Persistent Identifier | urn:nbn:nl:ui:29-286962 |
| Metadata | XML |
Go to page top
Go back to contents
Go back to site navigation