On ribbon graphs and virtual links
arXiv:2010.04238
Abstract
We introduce a new equivalence relation on decorated ribbon graphs, and show that its equivalence classes directly correspond to virtual links. We demonstrate how this correspondence can be used to convert any invariant of virtual links into an invariant of ribbon graphs, and vice versa.
arXiv comment35 pages, many figures. Comments welcome. This version to appear in the European Journal of Combinatorics