ON THE MAXIMUM NUMBER OF COLORS FOR LINKS
From MaRDI portal
Publication:4922107
DOI10.1142/S0218216513500132zbMath1420.57038arXiv1205.1467OpenAlexW2963002960MaRDI QIDQ4922107
Louis H. Kauffman, Pedro Lopes, Slavik Jablan
Publication date: 28 May 2013
Published in: Journal of Knot Theory and Its Ramifications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1205.1467
coloringstorus linksminimum number of colorsmaximum number of colorsdeterminants of linksrational linksSchubert Normal Form
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
The minimum number of Fox colors modulo 13 is 5 ⋮ Removing colors 2k, 2k − 1, and k ⋮ Remembering Slavik Jablan
Cites Work
- Knoten mit zwei Brücken
- A proof of the Kauffman-Harary conjecture
- Knots and graphs. I: Arc graphs and colorings
- On the minimum number of colors for knots
- THE MINIMUM NUMBER OF FOX COLORS AND QUANDLE COCYCLE INVARIANTS
- MINIMUM NUMBER OF FOX COLORS FOR SMALL PRIMES
- THE TENEVA GAME
- Any 7-colorable knot can be colored by four colors
This page was built for publication: ON THE MAXIMUM NUMBER OF COLORS FOR LINKS
