Clock Theorem - Knot Theory
I would recommend the recently republished Formal Knot Theory
by Louis Kauffman if you enjoy either topology or combinatorics. It connects the two in some interesting ways. In particular, the Clock Theorem (2.5 in the book) is introduced and proved. Gilmer and Litherland subsequently published a new proof and stated the theorem this way: the set of maximal trees in a connected plane graph has a naturally defined partial order, which gives it the structure of a distributive lattice.
This entry was posted
on Monday, July 21st, 2008 at 8:12 am and is filed under Knots.
You can follow any responses to this entry through the RSS 2.0 feed.
You can leave a response, or trackback from your own site.