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'.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.