A reduced set of moves on one-vertex ribbon graphs coming from links
Abstract
Every link in R3 can be represented by a one-vertex ribbon graph. We prove a Markov type theorem on this subset of link diagrams.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.