Minimal coloring numbers of $\mathbb{Z}$-colorable even-parallels of links
Eri Matsudo · arXiv (Cornell University) · 2017
We consider the link obtained by replacing each component of the given link with several parallel strands, which we call a parallel of a link. We show that an even parallel of a link is $\mathbb{Z}$-colorable except for the case of 2 parallels with non-zero linking number. We then determine the minimal coloring number for such $\mathbb{Z}$-colorable even parallels of links.