, Volume 22, Issue 1, pp 149-158

Spatial Graphs and Oriented Matroids: the Trefoil

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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.