Removing Colors 2k, 2k-1, and k
Abstract
We prove that if a link admits non-trivial (2k+1)-colorings, with prime 2k+1>7, it also admits non-trivial (2k+1)-colorings not involving colors 2k, 2k-1, nor k.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.