Regularity, depth and arithmetic rank of bipartite edge ideals (Q968233): Difference between revisions

Let \(G\) be an unmixed bipartite graph and let \(I\) denote its edge ideal. An explicit formula for the regularity of \(I\) is given. Bounds for the depth of \(R/I\), where \(R\) is the corresponding polynomial ring, and the arithmetic rank of \(I\) are also given. To obtain the regularity of \(I\), the author associates to \(G\) a directed graph \(\delta_G\) and shows that the regularity of \(I\) is one more than the cardinality of a maximum antichain in \(\delta_G\). The construction of \(\delta_G\) is motivated by a paper of \textit{J. Herzog} and \textit{T. Hibi} [J. Algebr. Comb. 22, No. 3, 289--302 (2005; Zbl 1090.13017)]. Bounds for the depth and the arithmetic rank are derived by considering special subgraphs of \(\delta_G\) (namely, a strong component and a maximal directed acyclic subgraphs of \(\delta_G\)).