Ir al contenido

Documat


Resumen de Edge coloring models and reflection positivity

Balázs Szegedy Árbol académico

  • 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.


Fundación Dialnet

Mi Documat