Abstract
We introduce a new class of graph parameters coming from invariants of the orthosymplectic group, which we call mixed partition functions. This class strictly contains partition functions of edge-coloring models and we give a characterization of this class by means of rank growth of associated connection matrices.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
