## Abstract In 1983, Conway and Gordon [J Graph Theory 7 (1983), 445β453] showed that every (tame) spatial embedding of __K__~7~, the complete graph on 7 vertices, contains a knotted cycle. In this paper, we adapt the methods of Conway and Gordon to show that __K__~3,3,1,1~ contains a knotted cycle
A newly recognized intrinsically knotted graph
β Scribed by Joel Foisy
- Publisher
- John Wiley and Sons
- Year
- 2003
- Tongue
- English
- Weight
- 113 KB
- Volume
- 43
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
In [Adams, 1994; The Knot Book], Colin Adams states as an open question whether removing a vertex and all edges incident to that vertex from an intrinsically knotted graph must yield an intrinsically linked graph. In this paper, we exhibit an intrinsically knotted graph for which there is a vertex that can be removed, and the resulting graph is not intrinsically linked. We further show that this graph is minor minimal with respect to being intrinsically knotted. Β© 2003 Wiley Periodicals, Inc. J Graph Theory 43: 199β209, 2003
π SIMILAR VOLUMES
## Abstract We demonstrate four intrinsically knotted graphs that do not contain each other, nor any previously known intrinsically knotted graph, as a minor. Β© 2006 Wiley Periodicals, Inc. J Graph Theory 54: 115β124, 2007