Characterizing partition functions of the edge-coloring model by rank growth
Combinatorics
2015-06-25 v2 Mathematical Physics
math.MP
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'.
Keywords
Cite
@article{arxiv.1211.3561,
title = {Characterizing partition functions of the edge-coloring model by rank growth},
author = {Alexander Schrijver},
journal= {arXiv preprint arXiv:1211.3561},
year = {2015}
}