Intrinsically Linked Graphs with Knotted Components
| dc.creator | Fleming, Thomas | |
| dc.date | 2007-05-15 | |
| dc.date.accessioned | 2026-07-07T08:01:35Z | |
| dc.date.available | 2026-07-07T08:01:35Z | |
| dc.description | We construct a graph G such that any embedding of G into R^{3} contains a nonsplit link of two components, where at least one of the components is a nontrivial knot. Further, for any m < n we produce a graph H so that every embedding of H contains a nonsplit n component link, where at least m of the components are nontrivial knots. We then turn our attention to complete graphs and show that for any given n, every embedding of a large enough complete graph contains a two component link whose linking number is a nonzero multiple of n. | |
| dc.description | 8 pages, 5 figures | |
| dc.identifier | https://arxiv.org/abs/0705.2026 | |
| dc.identifier | http://arxiv.org/abs/0705.2026 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/128954 | |
| dc.subject | Geometric Topology | |
| dc.subject | 57M15; 57M25; 05C10 | |
| dc.title | Intrinsically Linked Graphs with Knotted Components | |
| dc.type | text |