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
THEME Null option (theme 11)
Publisher Academic Press
Journal Journal of Combinatorial Theory - Series A
Project Networks
Grant This work was funded by the The Netherlands Organisation for Scientific Research (NWO); grant id nwo/024.002.003 - Networks
Citation
Schrijver, A. (2015). Characterizing partition functions of the edge-coloring model by rank growth. Journal of Combinatorial Theory - Series A, 136, 164–173.