Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
