## 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
Intrinsically knotted graphs
โ Scribed by Joel Foisy
- Publisher
- John Wiley and Sons
- Year
- 2002
- Tongue
- English
- Weight
- 100 KB
- Volume
- 39
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
โฆ Synopsis
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 in every spatial embedding. In the process, we establish that if a graph satisfies a certain linking condition for every spatial embedding, then the graph must have a knotted cycle in every spatial embedding. ยฉ 2002 Wiley Periodicals, Inc. J Graph Theory 39: 178โ187, 2002; DOI 10.1002/jgt.10017
๐ SIMILAR VOLUMES
## 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
We consider the equivalence classes of graphs induced by the unsigned versions of the Reidemeister moves on knot diagrams. Any graph that is reducible by some finite sequence of these moves, to a graph with no edges, is called a knot graph. We show that the class of knot graphs strictly contains the