Removing colors 2k, 2k ? 1, and k

摘要

This article concerns Fox colorings. We prove that if a link admits non-trivial (2k + 1)-colorings, with prime 2k + 1 ≥ 11, it also admits non-trivial (2k + 1)-colorings not involving colors 2k, 2k ? 1, nor k.