Abstract

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

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.