Edge coloring models and reflection positivity
Balázs Szegedy · arXiv (Cornell University) · 2005
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.