Abstract
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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.