Spatial Graphs and Oriented Matroids: the Trefoil
- 90 Downloads
Let m=m(K) be the smallest positive integer such that every linearspatialrepresentation of the complete graph with n vertices, n ≥ m , contains either the knot K or its mirror . In this paper we show that m(Trefoil)=7 . The proof uses the theory of oriented matroids.
Unable to display preview. Download preview PDF.