Spatial Graphs and Oriented Matroids: the Trefoil
- Cite this article as:
- Ramirez Alfonsin, J. Discrete Comput Geom (1999) 22: 149. doi:10.1007/PL00009446
- 88 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.