Edge coloring models and reflection positivity

Simple item page
dc.creatorSzegedy, Balazs
dc.date2005-05-02
dc.date.accessioned2026-07-07T05:19:35Z
dc.date.available2026-07-07T05:19:35Z
dc.descriptionSolving 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.
dc.identifierhttps://arxiv.org/abs/math/0505035
dc.identifierhttp://arxiv.org/abs/math/0505035
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/75071
dc.subjectCombinatorics
dc.subjectMathematical Physics
dc.subject05C99; 82B99
dc.titleEdge coloring models and reflection positivity
dc.typetext

Files

Collections

arXiv