Minimal coloring number for Z-colorable links

2016/05/26 by Ichihara, Kazuhiro, Matsudo, Eri
#FOS: Mathematics #Geometric Topology (math.GT)

paper · doi:10.48550/arxiv.1605.08127

Abstract

For a link with zero determinants, a Z-coloring is defined as a generalization of Fox coloring. We call a link having a diagram which admits a non-trivial Z-coloring a Z-colorable link. The minimal coloring number of a Z-colorable link is the minimal number of colors for non-trivial Z-colorings on diagrams of the link. We give sufficient conditions for non-splittable Z-colorable links to have the least minimal coloring number.

Related

• Minimal coloring number for ℤ-colorable links II
• The Minimal Coloring Number Of Any Non-splittable ℤ-colorable Link Is Four
• Minimal coloring number on minimal diagrams for ℤ-colorable links
• Minimal coloring numbers on minimal diagrams of torus links
• A lower bound on minimal number of colors for links