We characterize which graph invariants are partition functions of a vertex model over C, in terms of the rank growth of associated ‘connection matrices’
Academic Press
Journal of Combinatorial Theory - Series A
Networks
Networks and Optimization

Schrijver, A. (2015). Characterizing partition functions of the edge-coloring model by rank growth. Journal of Combinatorial Theory - Series A, 136, 164–173.