KNOTTED HAMILTONIAN CYCLES IN LINEAR EMBEDDING OF K7 INTO ℝ3
From MaRDI portal
Publication:4906465
Abstract: 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.
Recommendations
- scientific article; zbMATH DE number 1457521
- LINKING IN STRAIGHT-EDGE EMBEDDINGS OF K7
- scientific article; zbMATH DE number 6130007
- Knotted Hamiltonian cycles in spatial embeddings of complete graphs
- HAMILTONIAN CYCLES AND ROPE LENGTHS OF CONWAY ALGEBRAIC KNOTS
- Embeddings of non-simply-connected 4-manifolds in 7-space. I. Classification modulo knots
- On regular seven-membered loops in \(\mathbb{R}^3\) with arbitrary join angle
- \(SH(3)\)-Gordian distances between knots with up to seven crossings
- Hamiltonian knottedness and lifting paths from the shape invariant
- On the asymptotic expansions of the Kashaev invariant of hyperbolic knots with seven crossings
Cites work
- A refinement of the Conway-Gordon theorems
- AN UPPER BOUND ON EDGE NUMBERS OF 2-BRIDGE KNOTS AND LINKS
- HEPTAGONAL KNOTS AND RADON PARTITIONS
- KNOTS AND LINKS IN LINEAR EMBEDDINGS OF K6
- Knots and links in spatial graphs
- Knots and links in spatial graphs: a survey
- LINKING IN STRAIGHT-EDGE EMBEDDINGS OF K7
- On Linked Spatial Representations
- Polygon Indices and Superbridge Indices of Torus Knots and Links
- Spatial graphs and oriented matroids: The trefoil
- Stick knots
Cited in
(10)- Generalizations of the Conway-Gordon theorems and intrinsic knotting on complete graphs
- Recent developments in spatial graph theory
- LINKING IN STRAIGHT-EDGE EMBEDDINGS OF K7
- Generalization of the Conway-Gordon theorem and intrinsic linking on complete graphs
- On the number of links in a linearly embedded K3,3,1
- Knots in certain spatial graphs
- Intrinsically knotted graphs
- Improved lower bound for the number of knotted Hamiltonian cycles in spatial embeddings of complete graphs
- On regular seven-membered loops in \(\mathbb{R}^3\) with arbitrary join angle
- scientific article; zbMATH DE number 1457521 (Why is no real title available?)
This page was built for publication: KNOTTED HAMILTONIAN CYCLES IN LINEAR EMBEDDING OF K7 INTO ℝ3
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4906465)