加载中…
Negami found an upper bound on the stick number of a nontrivial knot in terms of the minimal crossing number of the knot which is $s(K) \leq 2 c(K)s(K) \leq c(K) + 32$-bridge knot or link, except in the case of the unlink and the Hopf link. In this paper we construct any -bridge knot or link of at least six crossings by using only straight sticks. This gives a new upper bound on stick numbers of -bridge knots and links in terms of crossing numbers.

生成讲解博客的中文版本

生成AI智能校验的中文版本