Abstract.
Let m=m(K) be the smallest positive integer such that every linear spatial representation 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.
Article PDF
Similar content being viewed by others
Use our pre-submission checklist
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Additional information
Received July 8, 1997, and in revised form January 16, 1998.
Rights and permissions
About this article
Cite this article
Ramirez Alfonsin, J. Spatial Graphs and Oriented Matroids: the Trefoil . Discrete Comput Geom 22, 149–158 (1999). https://doi.org/10.1007/PL00009446
Issue Date:
DOI: https://doi.org/10.1007/PL00009446