Independence complexes of circle graphs
Abstract
Independence complexes of circle graphs are purely combinatorial objects. However, when constructed from some diagram of a link L, they reveal topological properties of L, more specifically, of its Khovanov homology. We analyze the homotopy type of independence complexes of circle graphs, with a focus on those arising when the graph is bipartite. Moreover, we compute (real) extreme Khovanov homology of a 4-strand pretzel knot using chord diagrams and independence complexes.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.