Minimal coloring number for Z-colorable links. II

From MaRDI portal
Publication:5223022




Abstract: The minimal coloring number of a mathbbZ-colorable link is the minimal number of colors for non-trivial mathbbZ-colorings on diagrams of the link. In this paper, we show that the minimal coloring number of any non-splittable mathbbZ-colorable links is four. As an example, 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 mathbbZ-colorable except for the case of 2 parallels with non-zero linking number. We then give a simple way to obtain a diagram which attains the minimal coloring number for such even parallels of links.









This page was built for publication: Minimal coloring number for \(\mathbb{Z}\)-colorable links. II

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5223022)