Affiliation:
1. Liaoning Normal University, P. R. China
2. Dalian University of Technology, P. R. China
Abstract
This paper mainly studies the minimum number of colorings for all non-trivially 19-colored diagrams of any 19-colorable knot K. By using some special Reidemeister move, we successfully eliminated 13 colors from 19 colors. It can be seen that for any 19-colorable knot K, at least six colors are enough to color K, that is, the minimum number of 19-colorable knot is six.
Publisher
World Scientific Pub Co Pte Ltd
Subject
Algebra and Number Theory
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. An improvement of the lower bound for the minimum number of link colorings by quandles;Journal of Knot Theory and Its Ramifications;2023-06
2. Quandles, Knots, Quandle Rings and Graphs;Algebra without Borders – Classical and Constructive Nonassociative Algebraic Structures;2023