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

Understand

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'.