A proof of the Kauffman-Harary Conjecture
classification
🧮 math.GT
keywords
conjecturedifferentkauffman-hararyalternatingarcsassigncolorsdeterminant
read the original abstract
We prove the Kauffman-Harary Conjecture, posed in 1999: given a reduced, alternating diagram D of a knot with prime determinant p, every non-trivial Fox p-coloring of D will assign different colors to different arcs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.