Alternating Knot Diagrams, Euler Circuit
β
P.N. Balister; B. BollobΓ‘s; O.M. Riordan; A.D. Scott
π
Article
π
2001
π
Elsevier Science
π
English
β 81 KB
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