combinatorics / Graph Parameters, Tensor Categories
Regts and Sevenster conjectured that a complex-valued graph parameter $f$ with $f(\varnothing)=1$ has exponentially bounded edge-connection rank precisely when it is a mixed partition function. The paper proves it, with the numbers of even and odd colours bounded in terms of the rank bound.
Temporal state
No reconciled state yet.
Append-only history
Regts and Sevenster conjectured that a complex-valued graph parameter $f$ with $f(\varnothing)=1$ has exponentially bounded edge-connection rank precisely when it is a mixed partition function. The paper proves it, with the numbers of even and odd colours bounded in terms of the rank bound.
Research memory
Regts and Sevenster conjectured that a complex-valued graph parameter $f$ with $f(\varnothing)=1$ has exponentially bounded edge-connection rank precisely when it is a mixed partition function. The paper proves it, with the numbers of even and odd colours bounded in terms of the rank bound.
Evidence graph
No public relationships recorded yet.