Sequentially Cohen-Macaulay bipartite graphs: Vertex decomposability and regularity (Q1042425): Difference between revisions

The present paper deals with the combinatorial characterization of algebraic properties of edge ideals. In particular, the author considers bipartite graphs and their edge ideals. The paper contains two main results. The first result (Theorem 2.10) shows that the edge ideal of a bipartite graph is Sequentially Cohen-Macaulay (SCM) if and only if the independence complex of the graph is vertex descomposable, hence proving that SCM is a combinatorial property. The second result (Theorem 3.3) gives a formula for the Castelnuovo-Mumford regularity of SCM bipartite graphs in terms of the number of 3-disjoint edges of the graph. The paper continues a series of articles studying SCM bipartite graphs, including previous work by the author and other researchers, cf. \textit{S. Faridi} [J. Pure Appl. Algebra 190, No. 1-3, 121--136 (2004; Zbl 1045.05029)], \textit{C. A. Francisco} and \textit{H. T. Hà} [J. Comb. Theory, Ser. A 115, No. 2, 304-316 (2008; Zbl 1142.13021)], \textit{C. A. Francisco} and \textit{A. van Tuyl} [Proc. Am. Math. Soc. 135, No. 8, 2327--2337 (2007; Zbl 1128.13013) ], \textit{A. van Tuyl} and \textit{R. H. Villarreal} [J. Comb. Theory, Ser. A 115, No. 5, 799--814 (2008; Zbl 1154.05054)].