pith. sign in

arxiv: 0705.3453 · v1 · pith:NMZOLUZKnew · submitted 2007-05-23 · 🧮 math.GT · math.CO· math.QA

Graphs on surfaces and Khovanov homology

classification 🧮 math.GT math.COmath.QA
keywords graphsribbongraphhomologykhovanovspanningchorddiagram
0
0 comments X
read the original abstract

Oriented ribbon graphs (dessins d'enfant) are graphs embedded in oriented surfaces. A quasi-tree of a ribbon graph is a spanning subgraph with one face, which is described by an ordered chord diagram. We show that for any link diagram $L$, there is an associated ribbon graph whose quasi-trees correspond bijectively to spanning trees of the graph obtained by checkerboard coloring $L$. This correspondence preserves the bigrading used for the spanning tree model of Khovanov homology, whose Euler characteristic is the Jones polynomial of $L$. Thus, Khovanov homology can be expressed in terms of ribbon graphs, with generators given by ordered chord diagrams.

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.