| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4655138 | Journal of Combinatorial Theory, Series A | 2015 | 10 Pages |
Abstract
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’.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Alexander Schrijver,