Knotted Hamiltonian cycles in spatial embeddings of complete graphs (Q868643): Difference between revisions

Given a spatial embedding of a graph \(G\), then a cycle of \(G\) can be thought of as a knot. Recall that a Hamiltonian cycle of a graph \(G\) is a cycle that passes through every vertex of \(G\). In this paper, the authors prove that any spatial embedding of the complete graph on \(n\geq 7\) vertices contains a knotted Hamiltonian cycle. It is also proved that the minimum number of knotted Hamiltonian cycles in every spatial embedding of the complete graph on \(n\geq 8\) vertices contains at least \((n- 1)(n- 2)\cdots(9)(8)\) knotted Hamiltonian cycles.