On the number of links in a linearly embedded $K_{3,3,1}$

Abstract

We show there exists a linear embedding of $K_{3,3,1}$ with n nontrivial 2-component links if and only if n = 1, 2, 3, 4, or 5.

20 pages, 6 figures

References in corpus (2)

• Knotted Hamiltonian cycles in linear embedding of $K_7$ into ${\mathbb{R}}^3$
• Counting Links in Complete Graphs