加载中…
In 1983 Conway and Gordon proved that any embedding of the complete graph into contains at least one nontrivial knot as its Hamiltonian cycle. After their work knots (also links) are considered as intrinsic properties of abstract graphs, and numerous subsequent works have been continued until recently. In this paper we are interested in knotted Hamiltonian cycles in linear embedding of . Concretely it is shown that any linear embedding of contains at most three figure-8 knots as its Hamiltonian cycles.

生成讲解博客的中文版本

生成AI智能校验的中文版本