Edge coloring models and reflection positivity
Szegedy, Balazs
arXiv, 0505035 / Harvested from arXiv
Text on arXiv
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.
Publié le : 2005-05-02
Classification:  Mathematics - Combinatorics,  Mathematical Physics,  05C99,  82B99 
@article{0505035,
     author = {Szegedy, Balazs},
     title = {Edge coloring models and reflection positivity},
     journal = {arXiv},
     volume = {2005},
     number = {0},
     year = {2005},
     language = {en},
     url = {http://dml.mathdoc.fr/item/0505035}
}

Szegedy, Balazs. Edge coloring models and reflection positivity. arXiv, Tome 2005 (2005) no. 0, . http://gdmltest.u-ga.fr/item/0505035/