Characterizing partition functions of the edge-coloring model by rank growth
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'.
- Publication:
-
arXiv e-prints
- Pub Date:
- November 2012
- DOI:
- 10.48550/arXiv.1211.3561
- arXiv:
- arXiv:1211.3561
- Bibcode:
- 2012arXiv1211.3561S
- Keywords:
-
- Mathematics - Combinatorics;
- Mathematical Physics;
- 05C31;
- 82B05;
- 20C30