A lower bound on minimal number of colors for links
Geometric Topology
2015-07-16 v1
Abstract
We show that the minimal number of colors for all effective -colorings of a link with non-zero determinant is at least .
Keywords
Cite
@article{arxiv.1507.04088,
title = {A lower bound on minimal number of colors for links},
author = {Kazuhiro Ichihara and Eri Matsudo},
journal= {arXiv preprint arXiv:1507.04088},
year = {2015}
}
Comments
7 pages