Answers are grounded in this paper and cite their sources.
In 1983, J. H. Conway and C. McA. Gordon showed in [1] that every embedding of the complete graph K₇ in the three-dimensional Euclidean space R³ contains a knotted cycle. In this paper we generalize their method and show that every embedding of the complete bipartite graph K5,5 in R³ contains a knotted cycle.
No takes yet. Share an insight, caveat, or question.
Miki Miyauchi Shimabara (1988) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: