Papers
Topics
Authors
Recent
2000 character limit reached

Kauffman-Harary conjecture for alternating virtual knots

Published 16 Oct 2013 in math.GT | (1310.4271v1)

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.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.