Regularity, depth and arithmetic rank of bipartite edge ideals

From MaRDI portal
Publication:968233




Abstract: We study minimal free resolutions of edge ideals of bipartite graphs. We associate a directed graph to a bipartite graph whose edge ideal is unmixed, and give expressions for the regularity and the depth of the edge ideal in terms of invariants of the directed graph. For some classes of unmixed edge ideals, we show that the arithmetic rank of the ideal equals projective dimension of its quotient.




Cited in
(60)






This page was built for publication: Regularity, depth and arithmetic rank of bipartite edge ideals

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