Conway-Gordon type theorem for the complete four-partite graph \(K_{3,3,1,1}\) (Q2512553)

In [J. Graph Theory 39, No. 3, 178--187 (2002; Zbl 1176.05022)], \textit{J. Foisy} showed that \(K_{3,3,1,1}\) is intrinsically knotted and that it contains a knotted cycle whose Conway polynomial has a non-trivial second coefficient. The current paper refines this result by giving an identity between the second coefficients of the Conway polynomial of knots, and the linking numbers of two component links in spatial embeddings of \(K_{3,3,1,1}\). It is also shown that every rectilinear spatial embedding of \(K_{3,3,1,1}\) contains a non-trivial Hamiltonian knot.