arXiv · 1211.4131
Conway-Gordon type theorem for the complete four-partite graph $K_{3,3,1,1}$
Abstract
We give a Conway-Gordon type formula for invariants of knots and links in a spatial complete four-partite graph $K_{3,3,1,1}$ 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 $K_{3,3,1,1}$ contains a nontrivial Hamiltonian knot.
Explore related subjects
Keep this discovery
Hiroka Hashimoto, Ryo Nikkuni. 2012-11-17. Conway-Gordon type theorem for the complete four-partite graph $K_{3,3,1,1}$. https://arxiv.org/abs/1211.4131
Cite the original work for its findings. Save a collection to share your selection of sources.