2000 character limit reached
Kauffman-Harary conjecture for alternating virtual knots (1310.4271v1)
Published 16 Oct 2013 in math.GT
Abstract: In 1999, Kauffman-Harary conjectured that every non-trivial Fox $p$-coloring of a reduced, alternating knot diagram with prime determinant $p$ is heterogeneous. Ten years later this conjecture was proved by W. Mattman and P. Solis. Mathew Williamson generalized this conjecture to alternating virtual knots and proved it for certain families of virtual knots. In the present note, we use the methods of W. Mattman and P. Solis to give an affirmative answer to the Kauffman-Harary conjecture for alternating virtual knots.