pith. sign in

arxiv: 1001.0384 · v1 · submitted 2010-01-03 · 🧮 math.GT · math.CO

Graph-Links

classification 🧮 math.GT math.CO
keywords graph-linksgraphssomeconstructlanguagelinkstheoremstheory
0
0 comments X
read the original abstract

The present paper is a review of the current state of Graph-Link Theory (graph-links are also closely related to homotopy classes of looped interlacement graphs), dealing with a generalisation of knots obtained by translating the Reidemeister moves for links into the language of intersection graphs of chord diagrams. In this paper we show how some methods of classical and virtual knot theory can be translated into the language of abstract graphs, and some theorems can be reproved and generalised to this graphical setting. We construct various invariants, prove certain minimality theorems and construct functorial mappings for graph-knots and graph-links. In this paper, we first show non-equivalence of some graph-links to virtual links.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.