Intrinsic knotting and linking of almost complete partite graphs
| dc.creator | Mattman, Thomas W. | |
| dc.creator | Ottman, Ryan | |
| dc.creator | Rodrigues, Matt | |
| dc.date | 2003-12-09 | |
| dc.date | 2004-08-21 | |
| dc.date.accessioned | 2026-07-07T05:03:41Z | |
| dc.date.available | 2026-07-07T05:03:41Z | |
| dc.description | We classify graphs that are 0, 1, or 2 edges short of being complete partite graphs with respect to intrinsic linking and intrinsic knotting. In addition, we classify intrinsic knotting of graphs on 8 vertices. For graphs in these families, we verify a conjecture presented in Adams' "The Knot Book": If a vertex is removed from an intrinsically knotted graph, one obtains an intrinsically linked graph. | |
| dc.description | v2: 20 pages, 10 figures, substantial expansion of version 1 | |
| dc.identifier | https://arxiv.org/abs/math/0312176 | |
| dc.identifier | http://arxiv.org/abs/math/0312176 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/69519 | |
| dc.subject | Geometric Topology | |
| dc.subject | 05C10 (Primary) 57M15 (Secondary) | |
| dc.title | Intrinsic knotting and linking of almost complete partite graphs | |
| dc.type | text |