Khovanov-Rozansky homology and Directed Cycles
classification
🧮 math.CO
math.AC
keywords
directedkhovanov-rozanskyalgebraiccyclesgraphhomologycontainingcycle
read the original 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.
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.