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.
© 2008-2024 Fundación Dialnet · Todos los derechos reservados