Conway-Gordon type theorem for the complete four-partite graph
arXiv:1211.4131
Abstract
We give a Conway-Gordon type formula for invariants of knots and links in a spatial complete four-partite graph in terms of the square of the linking number and the second coefficient of the Conway polynomial. As an application, we show that every rectilinear spatial contains a nontrivial Hamiltonian knot.
21 pages, 11 figures