On effective 9-colorings for knots
Abstract
For a 1- or 2-dimensional knot, we give a lower bound log2 n + 1 of the minimum number of distinct colors for all effective n-colorings. In particular, we prove that any effectively 9-colorable 1- or ribbon 2-knot is presented by a diagram where exactly five colors of nine are assigned to the arcs or sheets.