Khovanov-Rozansky homology and directed cycles

From MaRDI portal
Publication:2408110



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 page was built for publication: Khovanov-Rozansky homology and directed cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2408110)