Manifolds and cell complexes Definition
Tricolorability
Builds on KnotReidemeister's theorem
Definition
Let be a diagram of a knot . The arcs of are the pieces into which falls when each under-strand is cut at each crossing. A tricoloring of is a map from the set of arcs of to a set of three colors such that:
- at each crossing, the over-arc and the two under-arcs have either one color or three distinct colors;
- at least two colors are used.
The diagram is tricolorable if it has a tricoloring. The knot is tricolorable if some diagram of is tricolorable.
Remarks
Each Reidemeister move turns a tricoloring into a tricoloring, so if one diagram of is tricolorable then every diagram of 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 , clause 1 says at a crossing with over-arc and under-arcs ; this is Fox -coloring. A knot is tricolorable if and only if divides its determinant , where 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
- no evidence level
- Knot concept
- Link concept
- Reidemeister's theorem statement
- Tricolorability definition
Further reading
About this page
| Tag | 878B9A4D9B |
|---|---|
| URI | m2://878B9A4D9B |
| Kind | definition |
| Writing | W0 stub |
| MSC | 57K10 |
| Defines | Tricolorability |
| Uses | Knot, Reidemeister's theorem |
| Changed | 2 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.