Edge coloring models and reflection positivity
Combinatorics
2007-05-23 v1 Mathematical Physics
math.MP
Abstract
Solving a conjecture of M. H. Freedman, L. Lov\'asz 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.
Cite
@article{arxiv.math/0505035,
title = {Edge coloring models and reflection positivity},
author = {Balazs Szegedy},
journal= {arXiv preprint arXiv:math/0505035},
year = {2007}
}