A lower bound on minimal number of colors for links

Abstract

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$.

7 pages

References in corpus (1)

• Minimal sufficient sets of colors and minimum number of colors

Cited by in corpus (1)

• 11-colored knot diagram with five colors