Article - pre-print
We investigate the minimal number of links and knots in embeddings of complete partite graphs in S3. We provide exact values or bounds on the minimal number of links for all complete partite graphs with all but 4 vertices in one partition, or with 9 vertices in total. In particular, we find that the minimal number of links in an embedding of K4,4,1 is 74. We also provide exact values or bounds on the minimal number of knots for all complete partite graphs with 8 vertices.
This is an author-manuscript of an article accepted for publication in Tokyo Journal of Mathematics following peer review. The version of record is available online at: doi:10.3836/tjm/1391177980.
Abrams, Loren; Mellor, Blake; Trott, Lowell. Counting Links and Knots in Complete Graphs. Tokyo J. of Math. 36 (2013), no. 2, 429--458. doi:10.3836/tjm/1391177980.