2015
Characterizing partition functions of the edge-coloring model by rank growth
Publication
Publication
Journal of Combinatorial Theory - Series A , Volume 136 p. 164- 173
We characterize which graph invariants are partition functions of a vertex
model over C, in terms of the rank growth of associated ‘connection matrices’
Additional Metadata | |
---|---|
Academic Press | |
Journal of Combinatorial Theory - Series A | |
Networks | |
Organisation | Networks and Optimization |
Schrijver, L. (2015). Characterizing partition functions of the edge-coloring model by rank growth. Journal of Combinatorial Theory - Series A, 136, 164–173. |