  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.
