Affordable Access

Khovanov-Rozansky homology and Directed Cycles

Authors
  • Wu, Hao
Type
Preprint
Publication Date
Oct 23, 2015
Submission Date
Aug 28, 2015
Identifiers
arXiv ID: 1508.07337
Source
arXiv
License
Yellow
External links

Abstract

We determine the cycle packing number of a directed graph using elementary projective algebraic geometry. Our idea is rooted in the Khovanov-Rozansky theory. In fact, using the Khovanov-Rozansky homology of a graph, we also obtain algebraic methods of detecting directed and undirected cycles containing a particular vertex or edge.

Report this publication

Statistics

Seen <100 times