The Minimal Coloring Number Of Any Non-splittable $\mathbb{Z}$-colorable Link Is Four
Geometric Topology
2017-06-28 v1 Algebraic Topology
Abstract
K. Ichihara and E. Matsudo introduced the notions of -colorable links and the minimal coloring number for -colorable links, which is one of invariants for links. They proved that the lower bound of minimal coloring number of a non-splittable -colorable link is 4. In this paper, we show the minimal coloring number of any non-splittable -colorable link is exactly 4.
Cite
@article{arxiv.1706.08837,
title = {The Minimal Coloring Number Of Any Non-splittable $\mathbb{Z}$-colorable Link Is Four},
author = {Meiqiao Zhang and Xian'an Jin and Qingying Deng},
journal= {arXiv preprint arXiv:1706.08837},
year = {2017}
}
Comments
21 pages, 33 figures