Math 2.0

Manifolds and cell complexes Definition

Tricolorability

Builds on KnotReidemeister's theorem

Definition

Let DD be a diagram of a knot KK. The arcs of DD are the pieces into which DD falls when each under-strand is cut at each crossing. A tricoloring of DD is a map from the set of arcs of DD to a set of three colors such that:

  1. at each crossing, the over-arc and the two under-arcs have either one color or three distinct colors;
  2. at least two colors are used.

The diagram DD is tricolorable if it has a tricoloring. The knot KK is tricolorable if some diagram of KK is tricolorable.

Remarks

Each Reidemeister move turns a tricoloring into a tricoloring, so if one diagram of KK is tricolorable then every diagram of KK is. Example: the standard diagram of the trefoil knot has three arcs and three crossings, and each crossing meets all three arcs; three distinct colors satisfy both clauses. Non-example: the round diagram of the unknot has one arc, so clause 2 fails; hence the trefoil is not the unknot. The figure-eight knot is not tricolorable. With the colors read as elements of ℤ/3\Z/3, clause 1 says 2a≡b+c(mod3)2a \equiv b + c \pmod 3 at a crossing with over-arc aa and under-arcs b,cb, c; this is Fox 33-coloring. A knot is tricolorable if and only if 33 divides its determinant ∣ΔK(−1)∣\abs{\Delta_K(-1)}, where ΔK\Delta_K is the Alexander polynomial.

Reading path

To understand this page from the ground up, read these 4 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Knot concept
  2. Link concept
  3. Reidemeister's theorem statement
  4. Tricolorability definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Tricolorability
About this page
Tag878B9A4D9B
URIm2://878B9A4D9B
Kinddefinition
WritingW0 stub
MSC57K10
DefinesTricolorability
UsesKnot, Reidemeister's theorem
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.