加载中…
We prove that any -colorable knot is presented by an -colored diagram where exactly five colors of eleven are assigned to the arcs. The number five is the minimum for all non-trivially -colored diagrams of the knot. We also prove a similar result for any -colorable ribbon -knot.

生成讲解博客的中文版本

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