Removing Colors 2k, 2k-1, and k
classification
🧮 math.GT
keywords
admitscoloringscolorsnon-trivialinvolvinglinkprimeprove
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.