Minimal sufficient sets of colors and minimum number of colors
From MaRDI portal
Publication:5357451
DOI10.1142/S0218216517430088zbMath1377.57015arXiv1501.02421OpenAlexW2963956265MaRDI QIDQ5357451
Xian'an Jin, Pedro Lopes, Jun Ge, Louis H. Kauffman, Lian Zhu Zhang
Publication date: 8 September 2017
Published in: Journal of Knot Theory and Its Ramifications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.02421
minimum number of colorslink coloringsequivalence classes of coloringsminimal sufficient sets of colors
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
An improvement of the lower bound for the minimum number of link colorings by quandles ⋮ The minimum number of Fox colors modulo 13 is 5 ⋮ 11-Colored knot diagram with five colors
Cites Work
- Unnamed Item
- Unnamed Item
- The minimum number of Fox colors modulo 13 is 5
- 5-colored knot diagram with four colors
- Knots and graphs. I: Arc graphs and colorings
- On the minimum number of colors for knots
- 11-Colored knot diagram with five colors
- Any 11-Colorable knot can be colored with at most six colors
- A lower bound on minimal number of colors for links
- THE MINIMUM NUMBER OF FOX COLORS AND QUANDLE COCYCLE INVARIANTS
- MINIMUM NUMBER OF FOX COLORS FOR SMALL PRIMES
- ALTERNATING SUM FORMULAE FOR THE DETERMINANT AND OTHER LINK INVARIANTS
- THE TENEVA GAME
- Equivalence classes of colorings
- The minimization of the number of colors is different at p = 11
- AUTOMORPHISM GROUPS OF QUANDLES
- Any 7-colorable knot can be colored by four colors
This page was built for publication: Minimal sufficient sets of colors and minimum number of colors
