Weakly linked embeddings of pairs of complete graphs in \(\mathbb{R}^3\) (Q2138585)

Let \(G\) and \(H\) be disjoint embeddings of complete graphs \(K_m\) and \(K_n\) in \({\mathbb R}^3\) such that some cycle in \(G\) links a cycle in \(H\) with non-zero linking number. We say that \(G\) and \(H\) are \textit {weakly linked} if the absolute value of the linking number of any cycle in \(G\) with a cycle in \(H\) is \(0\) or \(1\). The authors' main result is an algebraic characterisation of when a pair of disjointly embedded complete graphs is weakly linked. As a step towards this result, they show that if \(G\) and \(H\) are weakly linked, then each contains either a vertex common to all triangles linking the other or a triangle that shares an edge with all triangles linking the other. All families of weakly linked pairs of embedded complete graphs are then characterised by which of these two cases holds in each complete graph. The authors build the results up in stages, first characterizing weak linking between a simple closed curve and an embedded complete graph \(K_n\), then between a \(\theta\) curve and \(K_n\), then \(K_4\) and \(K_n\). They conclude with a brief discussion of the problem of determining the least \(n\) such that every embedding of \(K_n\) contains a pair of cycles that are not weakly linked. The value \(n=9\) is conjectured to be the least such \(n\), but it is not yet proven. Techniques that apply for \(n>9\) use ``pasting'' of linked cycles together (see, for example [\textit{E. Flapan} et al., Topology Appl. 115, No. 2, 239--246 (2001; Zbl 0988.57003)]). These techniques do not seem to work for \(n=9\).