Characterizing partition functions of the edge-coloring model by rank growth
classification
🧮 math.CO
math-phmath.MP
keywords
edge-coloringfunctionsgrowthmodelpartitionrankassociatedcharacterize
read the original 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'.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.