Matching Theory (North-Holland mathematics studies)
Matching Theory (North-Holland mathematics studies)
Distributive Lattices, Bipartite Graphs and Alexander Duality
Journal of Algebraic Combinatorics: An International Journal
Characteristic-independence of Betti numbers of graph ideals
Journal of Combinatorial Theory Series A
Monomial ideals, edge ideals of hypergraphs, and their graded Betti numbers
Journal of Algebraic Combinatorics: An International Journal
Regularity, depth and arithmetic rank of bipartite edge ideals
Journal of Algebraic Combinatorics: An International Journal
Hi-index | 0.00 |
The algebra of basic covers of a graph G, denoted by $\bar{A}(G)$ , was introduced by Herzog as a suitable quotient of the vertex cover algebra. In this paper we compute the Krull dimension of $\bar{A}(G)$ in terms of the combinatorics of G. As a consequence, we get new upper bounds on the arithmetical rank of monomial ideals of pure codimension 2. Furthermore, we show that if the graph is bipartite, then $\bar{A}(G)$ is a homogeneous algebra with straightening laws, and thus it is Koszul. Finally, we characterize the Cohen---Macaulay property and the Castelnuovo---Mumford regularity of the edge ideal of a certain class of graphs.