Characterizing partition functions of the edge-coloring model by rank growth

We characterize which graph invariants are partition functions of an edge-coloring model over CC, in terms of the rank growth of associated ‘connection matrices’.