|
|||||
|
|
Edge coloring models and reflection positivity |
|
| Authors: | Balá zs Szegedy |
| Affiliation: | Microsoft Research, One Microsoft Way, Redmond, Washington 98052 |
| Abstract: | Solving a conjecture of M. H. Freedman, L. Lovász and A. Schrijver, we prove that a graph parameter is edge reflection positive and multiplicative if and only if it can be represented by an edge coloring model. |
| Keywords: | |
| 点击此处可从《Journal of the American Mathematical Society》浏览原始摘要信息 | |
| 点击此处可从《Journal of the American Mathematical Society》下载全文 | |