Knotted Hamiltonian cycles in linear embedding of K7 into R3
Abstract
In 1983 Conway and Gordon proved that any embedding of the complete graph K7 into R3 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 K7. Concretely it is shown that any linear embedding of K7 contains at most three figure-8 knots as its Hamiltonian cycles.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.