Knotted Hamiltonian cycles in spatial embeddings of complete graphs
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.
- Corrigendum to ``Knotted Hamiltonian cycles in spatial embeddings of complete graphs
- Spatial graphs, knots and the cyclic polytope
- Knots in spatial embeddings of the complete graph on four vertices
- Knots and links in certain spatial complete graphs
- Knots in certain spatial graphs
- On linking of Hamiltonian pairs of cycles in spatial graphs
- GRAPHS WITH A KNOT OR 3-COMPONENT LINK IN EVERY SPATIAL EMBEDDING
- A characterization of knots in a spatial graph
- scientific article; zbMATH DE number 1160692
- Knots in certain spatial graphs
- Generalizations of the Conway-Gordon theorems and intrinsic knotting on complete graphs
- Knots in spatial embeddings of the complete graph on four vertices
- Improved lower bound for the number of knotted Hamiltonian cycles in spatial embeddings of complete graphs
- KNOTTED HAMILTONIAN CYCLES IN LINEAR EMBEDDING OF K7 INTO ℝ3
- Capturing links in spatial complete graphs
- Converses to generalized Conway-Gordon type congruences
- On linking of Hamiltonian pairs of cycles in spatial graphs
- Corrigendum to ``Knotted Hamiltonian cycles in spatial embeddings of complete graphs
- Spatial graphs, knots and the cyclic polytope
This page was built for publication: Knotted Hamiltonian cycles in spatial embeddings of complete graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q868643)