Let $A$ and $B$ be skew lines in $\mathbb{R}^3$. Choose four points $a\_1, a\_2, a\_3, a\_4$ on $A$ and four points $b\_1, b\_2, b\_3, b\_4$. For all $i,j \in [4]$ draw a line segment from $a\_i$ to $b\_j$. Since $A$ and $B$ are skew, none of these line segments intersect each other. Thus, this is a straight line drawing of $K\_{4,4}$ in $\mathbb{R}^3$ without crossings.



> 
> Is this drawing of $K\_{4,4}$ **knotted**?
> 
> 
> 


Recall that a drawing of a graph $G$ is *knotted* if some cycle of $G$ is drawn as a non-trivial knot. I suspect that the answer is no, but could not prove it. The motivation for this problem comes from a [paper](https://arxiv.org/abs/2009.12989) of David Wood and myself, where we determine the maximum number of copies of a fixed tree in various sparse graph classes. A negative answer to the above question would essentially solve the problem exactly for the class of *knotless* graphs. These are the graphs that have a knotless embedding in $\mathbb{R}^3$.


One approach would be to use the classification of knots with small [stick number](https://en.wikipedia.org/wiki/Stick_number), but I am hoping there is a more elegant solution. The answer might depend on the positions of the points on $A$ and $B$. I would be happy if at least one choice of points yields a knotless drawing.



Is this drawing of $K_{4,4}$ knotted?
Here is a proof that all such embeddings are knotless. Consider the four half-planes bounded by $A$ which each contain one of the points $b\_i$. Then these planes give an open-book decomposition which contains $K\_{4,4}$. Each plane contains four edges, but if $L$ is a cycle of $K\_{4,4}$, then it can only contain at most two edges from each plane, since it can contain at most two of the edges which meet each $b\_i$. This gives an arc presentation of $L$ which has arc-index at most $4$. But it is [known](https://doi.org/10.1017/S0305004100074181) that every non-trivial knot has arc index at least $5$. Therefore the embedding of $K\_{4,4}$ is knotless.




---


Below is my original answer, giving one explicit knotless embedding.


Let the points on $A$ be $\{(-4,0,0), (-1,0,0), (1,0,0), (4,0,0)\}$. Let the points on $B$ be $\{(0,-3,1), (0,-2,1), (0,2,1), (0,3,1)\}$. Look at the projection $\pi$ of $K\_{4,4}$ onto the $xy$ plane, which has exactly four crossings. A non-trivial knot has at least three crossings in any diagram.


Suppose $L$ is a non-trivial knot or link embedded in this $K\_{4,4}$. Then $L$ has at most 8 edges. If $\pi(L)$ contains all four crossings, then $L$ is a pair of unlinked circles. If $\pi(L)$ contains three crossings, then by symmetry, it doesn't matter which three are chosen, and $L$ is an unknot. Therefore this embedding is knotless. There is however a Hopf link in this $K\_{4,4}$, which uses two opposite crossings, so this embedding is not linkless.


Different choices of points could give many more crossings in the projection, and I wouldn't like to try to extend this argument to anything much more complicated.


