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.

Let D be a weighted oriented graph, whose underlying graph is G , and let I (D) its edge ideal. If has no 3-, 5-, or 7-cycles, K?nig, we characterize when unmixed. 3- 5-cycles, Cohen–Macaulay. We prove that unmixed if only Cohen–Macaulay girth greater than 7 K?nig 4-cycles.

A tetrahedral curve is a (usually nonreduced) curve in P defined by an unmixed, height two ideal generated by monomials. We characterize when these curves are arithmetically Cohen-Macaulay by associating a graph to each curve and, using results from combinatorial commutative algebra and Alexander duality, relating the structure of the complementary graph to the Cohen-Macaulay property.

For an unmixed bipartite graph G we consider the lattice of vertex covers LG and compute depth, projective dimension and extremal Bettinumbers of R/I(G) in terms of this lattice.

In a paper in 2008, Herzog, Hibi and Ohsugi introduced and studied the semigroup ring associated to the set of minimal vertex covers of an unmixed bipartite graph. In this paper we relate the dimension of this semigroup ring to the rank of the Boolean lattice associated to the graph.

In a paper in 2008, Herzog, Hibi and Ohsugi introduced and studied the semigroup ring associated to the set of minimal vertex covers of an unmixed bipartite graph. In this paper we relate the dimension of this semigroup ring to the rank of the Boolean lattice associated to the graph.

We characterize unmixed and Cohen-Macaulay edge-weighted edge ideals of very well-covered graphs. also provide examples oriented graphs that have non-Cohen-Macaulay vertex-weighted ideals, while the ideal their underlying graph is Cohen-Macaulay. This disproves a conjecture posed by Pitones, Reyes, Toledo.

A very well–covered graph is an unmixed without isolated vertices such that the height of its edge ideal half number vertices. We study these graphs by means Betti splittings and mapping cone constructions. show cover ideals Cohen–Macaulay are splittable. As a consequence, we compute explicitly minimal graded free resolution class prove have homological linear quotients. Finally, conjecture sam...

Let G = (V,E) be a graph. If G is a König graph or if G is a graph without 3-cycles and 5-cycles, we prove that the following conditions are equivalent: ∆G is pure shellable, R/I∆ is Cohen-Macaulay, G is an unmixed vertex decomposable graph and G is well-covered with a perfect matching of König type e1, . . . , eg without 4-cycles with two ei’s. Furthermore, we study vertex decomposable and she...

The cut sets of a graph are special vertices whose removal disconnects the graph. They fundamental in study binomial edge ideals, since they encode their minimal primary decomposition. We introduce class accessible graphs as with unmixed ideal and form an set system. prove that is Cohen-Macaulay we conjecture converse holds. settle for large classes graphs, including chordal traceable providing...