3 papers
math.CO2018
Mixed partition functions and exponentially bounded edge-connection rank
Guus Regts, Bart Sevenster
We study graph parameters whose associated edge-connection matrices have exponentially bounded rank growth. Our main result is an explicit construction of a large class of graph pa…
math.CO2018
On the circular chromatic number of a subgraph of the Kneser graph
Bart Litjens, Sven Polak, Bart Sevenster +1
Let be positive integers with and . Consider a circle with~ points~ in clockwise order. The -stable \emph{interlacing graph} $\t…
math.QA2015
On the existence of real R-matrices for virtual link invariants
Guus Regts, Alexander Schrijver, Bart Sevenster
We characterize the virtual link invariants that can be described as partition function of a real-valued R-matrix, by being weakly reflection positive. Weak reflection positivity i…