ScalingStacks

0PMK

Corollary 13 Let DD be an adequate diagram with nn crossings of a link L.L. Then c⁡(L)=n.c(L)=n.

Original mathematics by the credited authors. Source collection and HTML conversion remain in progress.

Mikhail Khovanov

Original source: arXiv:math/9908171v2