Characterizing partition functions of the edge-coloring model by rank growth

Schrijver, Lex

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
Organisation	Networks and Optimization
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Schrijver, L. (2015). Characterizing partition functions of the edge-coloring model by rank growth. Journal of Combinatorial Theory - Series A, 136, 164–173.

Free Full Text ( Final Version , 122kb )

Additional Files
Fulltext Final Version
Publisher Version

Characterizing partition functions of the edge-coloring model by rank growth

Publication

Publication

Address

CWI researchers

Questions or comments?

Characterizing partition functions of the edge-coloring model by rank growth

Publication

Publication

Workflow

Workflow

Add Content