A proof of the Kauffman–Harary Conjecture

  title={A proof of the Kauffman–Harary Conjecture},
  author={Thomas W. Mattman and Pablo Solis},
  journal={Algebraic \& Geometric Topology},
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. 

Figures from this paper

Kauffman–Harary conjecture for alternating virtual knots
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 provedExpand
Relations will be described between the quandle cocycle invariant and the minimum number of colors used for non-trivial Fox colorings of knots and links. In particular, a lower bound for the minimumExpand
Colorings beyond Fox: the other linear Alexander quandles
This article is about applications of linear algebra to knot theory. For example, for odd prime p, there is a rule (given in the article) for coloring the arcs of a knot or link diagram from theExpand
Colorings beyond Fox : the other linear
This article is about applications of linear algebra to knot theory. For example, for odd prime p, there is a rule (given in the article) for coloring the arcs of a knot or link diagram from theExpand
Dehn coloring and the dimer model for knots
Fox coloring provides a combinatorial framework for studying dihedral representations of the knot group. The less well-known concept of Dehn coloring captures the same data. Recent work ofExpand
Minimum Number of Fox Colors for Small Primes
This article concerns exact results on the minimum number of colors of a Fox coloring over the integers modulo r, of a link with non-null determinant. Specifically, we prove that whenever the leastExpand
Positive quandle homology and its applications in knot theory
Algebraic homology and cohomology theories for quandles have been studied extensively in recent years. With a given quandle 2‐cocycle (3‐cocycle) one can define a state-sum invariant for knottedExpand
On the Maximum Number of Colors for Links
For each odd prime p, and for each non-split link admitting non-trivial p-colorings, we prove that the maximum number of Fox colors is p. We also prove that we can assemble a non-trivial p-coloringExpand
The Teneva Game
For each prime p > 7 we obtain the expression for an upper bound on the minimum number of colors needed to non-trivially color T(2, p), the torus knots of type (2, p), modulo p. This expression is tExpand
The Delunification Process and Minimal Diagrams
Abstract A link diagram is said to be lune-free if, when viewed as a 4-regular plane graph it does not have multiple edges between any pair of nodes. We prove that any colored link diagram isExpand


The Kauffman–Harary conjecture states that for any reduced alternating diagram K of a knot with a prime determinant p, every non-trivial Fox p-coloring of K assigns different colors to its arcs. WeExpand
A spanning tree expansion of the jones polynomial
A NEW combinatorial formulation of the Jones polynomial of a link is used to establish some basic properties of this polynomial. A striking consequence of these properties is the result that a linkExpand
On the Harary-Kauffman Conjecture and Turk's Head Knots
The m,n Turk's Head Knot, THK(m,n), is an "alternating (m,n) torus knot." We prove the Harary-Kauffman conjecture for all THK(m,n) except for the case where m \geq 5 is odd and n \geq 3 is relativelyExpand
On the classification of rational tangles
Two new combinatorial proofs of the classification of rational tangles using the calculus of continued fractions are given and an elementary proof that alternatingrational tangles have minimal number of crossings is obtained. Expand
Jones polynomials and classical conjectures in knot theory
The primeness is necessary in the last statement ofTheorem B, since the connected sum of two figure eight knots is alternating, but it has a minimal non-alternating projection. Note that the figureExpand
Knots and graphs
Abstract We examine how graphs and techniques from graph theory can be transferred into knot theory. In particular, we look at how a certain graph polynomial may be used to calculate the braid index,Expand
3-coloring and other elementary invariants of knots
Classical knot theory studies the position of a circle (knot) or of several circles (link) in R or S = R3∪∞. The fundamental problem of classical knot theory is the classification of links (includingExpand
Knots and Graphs I-Arc Graphs and Colorings
It is well-known that combinatorial knot theory is a graph theoretic way to approach the theory of knots, links, and their topology in three-dimensional space. The usual formulation of this theoryExpand
State Models and the Jones Polynomial
IN THIS PAPER I construct a state model for the (original) Jones polynomial [5]. (In [6] a state model was constructed for the Conway polynomial.) As we shall see, this model for the Jones polynomialExpand
Tales of Topology. (Book Reviews: The Knot Book. An Elementary Introduction to the Mathematical Theory of Knots.)
Introduction Tabulating knots Invariants of knots Surfaces and knots Types of knots Polynomials Biology, chemistry, and physics Knots, links, and graphs Topology Higher dimensional knotting KnotExpand