Intrinsic Properties of Spatial Graphs - Denison University
Intrinsic Properties of Spatial Graphs - Denison University
Intrinsic Properties of Spatial Graphs - Denison University
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Introduction Linking and Knotting Other <strong>Intrinsic</strong> <strong>Properties</strong> ConclusionCounting Links and KnotsRather than asking how complicated the links and knots in aspatial graph must be, we could instead ask how many theremust be.Conway and Gordon found an embedding <strong>of</strong> K 6 with exactlyone link, and an embedding <strong>of</strong> K 7 with exactly one (trefoil) knot.But larger graphs will be forced to contain many links and knots.Blake Mellor<strong>Intrinsic</strong> <strong>Properties</strong> <strong>of</strong> <strong>Spatial</strong> <strong>Graphs</strong>
Change language