Intrinsic linking and knotting in virtual spatial graphs
From MaRDI portal
Publication:2464765
Abstract: We introduce a notion of intrinsic linking and knotting for virtual spatial graphs. Our theory gives two filtrations of the set of all graphs, allowing us to measure, in a sense, how intrinsically linked or knotted a graph is; we show that these filtrations are descending and non-terminating. We also provide several examples of intrinsically virtually linked and knotted graphs. As a byproduct, we introduce the {it virtual unknotting number} of a knot, and show that any knot with non-trivial Jones polynomial has virtual unknotting number at least 2.
Recommendations
Cites work
- A newly recognized intrinsically knotted graph
- An invariant of spatial graphs
- scientific article; zbMATH DE number 5532122 (Why is no real title available?)
- scientific article; zbMATH DE number 125433 (Why is no real title available?)
- scientific article; zbMATH DE number 1092415 (Why is no real title available?)
- Intrinsically knotted graphs
- INTRINSICALLY n-LINKED GRAPHS
- Invariants of Graphs in Three-Space
- Knots and links in spatial graphs
- Minimal surface representations of virtual knots and links
- Sachs' linkless embedding conjecture
- Virtual knot theory
Cited in
(9)- Counting links in complete graphs
- The generalized Yamada polynomials of virtual spatial graphs
- An introduction to virtual spatial graph theory
- Classical and virtual pseudodiagram theory and new bounds on unknotting numbers and genus
- Knot theory for spatial graphs attached to a surface
- scientific article; zbMATH DE number 5532122 (Why is no real title available?)
- Intrinsic linking and knotting are arbitrarily complex in directed graphs
- Spatial graphoids
- Numerical invariants for two-component virtual spatial graphs
This page was built for publication: Intrinsic linking and knotting in virtual spatial graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2464765)