A lower bound on minimal number of colors for links

preprint2015arXivOpen access

We show that the minimal number of colors for all effective $n$ -colorings of a link with non-zero determinant is at least $1+\log_2 n$ .

Explore this paper’s authors, topics and related work.

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

Abstract