Tangles and links: a view with trees
Daniel S. Silver, Susan G. Williams
TL;DR
This paper presents a new perspective on tangles and links using trees, providing a simplified proof of Krebes's theorem related to embedded tangles in links.
Contribution
It introduces a novel approach connecting spanning forests and graph theory to knot theory, offering a concise proof of Krebes's theorem.
Findings
Short proof of Krebes's theorem
New graph-theoretic perspective on tangles
Enhanced understanding of embedded tangles in links
Abstract
A result about spanning forests for graphs yields a short proof of Krebes's theorem concerning embedded tangles in links.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.