Characterizing partition functions of the edge-coloring model by rank growth
arXiv:1211.3561
Abstract
We characterize which graph invariants are partition functions of an edge-coloring model over the complex numbers, in terms of the rank growth of associated `connection matrices'.