Removing Colors 2k, 2k-1, and k
Geometric Topology
2013-08-27 v1
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.
Keywords
Cite
@article{arxiv.1308.5278,
title = {Removing Colors 2k, 2k-1, and k},
author = {Pedro Lopes},
journal= {arXiv preprint arXiv:1308.5278},
year = {2013}
}