In knot theory, a knot or link diagram is alternating if the crossings alternate under, over, under, over, as one travels along each component of the link. A link is alternating if it has an alternating diagram.
Many of the knots with crossing number less than 10 are alternating. This fact and useful properties of alternating knots, such as the Tait conjectures, was what enabled early knot tabulators, such as Tait, to construct tables with relatively few mistakes or omissions. The simplest nonalternating prime knots have 8 crossings (and there are three such: 8_{19}, 8_{20}, 8_{21}).
It is conjectured that as the crossing number increases, the percentage of knots that are alternating goes to 0 exponentially quickly.
Alternating links end up having an important role in knot theory and 3manifold theory, due to their complements having useful and interesting geometric and topological properties. This led Ralph Fox to ask, "What is an alternating knot?"^{[citation needed]} By this he was asking what nondiagrammatic properties of the knot complement would characterize alternating knots.
In November 2015, Joshua Evan Greene published a preprint that established a characterization of alternating links in terms of definite spanning surfaces, i.e. a definition of alternating links (of which alternating knots are a special case) without using the concept of a link diagram.^{[1]}
Various geometric and topological information is revealed in an alternating diagram. Primeness and splittability of a link is easily seen from the diagram. The crossing number of a reduced, alternating diagram is the crossing number of the knot. This last is one of the celebrated Tait conjectures.
An alternating knot diagram is in onetoone correspondence with a planar graph. Each crossing is associated with an edge and half of the connected components of the complement of the diagram are associated with vertices in a checker board manner.
YouTube Encyclopedic

1/3Views:124 063327 435997

How To Tie a Right Half Knot Spiral For Hemp Jewelry

How to Tie a Zigzag Braid by TIAT

Square Knot Bracelet Tutorial
Transcription
Contents
Tait conjectures
The Tait conjectures are:
 Any reduced diagram of an alternating link has the fewest possible crossings.
 Any two reduced diagrams of the same alternating knot have the same writhe.
 Given any two reduced alternating diagrams D_{1} and D_{2} of an oriented, prime alternating link: D_{1} may be transformed to D_{2} by means of a sequence of certain simple moves called flypes. Also known as the Tait flyping conjecture.^{[2]}
Morwen Thistlethwaite, Louis Kauffman and K. Murasugi proved the first two Tait conjectures in 1987 and Morwen Thistlethwaite and William Menasco proved the Tait flyping conjecture in 1991.
Hyperbolic volume
Menasco, applying Thurston's hyperbolization theorem for Haken manifolds, showed that any prime, nonsplit alternating link is hyperbolic, i.e. the link complement has a hyperbolic geometry, unless the link is a torus link.
Thus hyperbolic volume is an invariant of many alternating links. Marc Lackenby has shown that the volume has upper and lower linear bounds as functions of the number of twist regions of a reduced, alternating diagram.
References
 ^ Greene, Joshua. "Alternating links and definite surfaces". arXiv:1511.06329 .
 ^ Weisstein, Eric W. "Tait's Knot Conjectures". MathWorld. Accessed: May 5, 2013.
Further reading
 Kauffman, Louis H. (1987). On Knots. Annals of Mathematics Studies. 115. Princeton University Press. ISBN 0691084351. Zbl 0627.57002.
 C. Adams, The Knot Book: An elementary introduction to the mathematical theory of knots. American Mathematical Society, Providence, RI, 2004. xiv+307 pp. ISBN 0821836781
 William Menasco, Closed incompressible surfaces in alternating knot and link complements. Topology 23 (1984), no. 1, 37–44.
 Marc Lackenby, The volume of hyperbolic alternating link complements. With an appendix by Ian Agol and Dylan Thurston. Proc. London Math. Soc. (3) 88 (2004), no. 1, 204–224.
External links
 Celtic Knotwork to build an alternating knot from its planar graph