A lower bound on minimal number of colors for links

Kazuhiro Ichihara, Eri Matsudo

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