摘要
We prove that for any odd n >= 3, the n-palette number of any effectively n-colorable 2-bridge knot is equal to 2+ [log(2) n]. Namely, there is an effectively n-colored diagram of the 2-bridge knot such that the number of distinct colors that appeared in the diagram is exactly equal to 2 + [log(2) n].
- 出版日期2017-7