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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
