✦ LIBER ✦
Alternating Knot Diagrams, Euler Circuits and the Interlace Polynomial
✍ Scribed by P.N. Balister; B. Bollobás; O.M. Riordan; A.D. Scott
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 81 KB
- Volume
- 22
- Category
- Article
- ISSN
- 0195-6698
No coin nor oath required. For personal study only.
✦ Synopsis
We show that two classical theorems in graph theory and a simple result concerning the interlace polynomial imply that if K is a reduced alternating link diagram with n ≥ 2 crossings, then the determinant of K is at least n. This gives a particularly simple proof of the fact that reduced alternating links are nontrivial.