Let G be a finite simple graph on a vertex set V (G) = {x11, . . . , xn1}. Also let m1, . . . , ,mn ≥ 2 be integers and G1, . . . , Gn be connected simple graphs on the vertex sets V (Gi) = {xi1, . . . , ximi}. In this paper, we provide necessary and sufficient conditions on G1, . . . , Gn for which the graph obtained by attaching the Gi to G is unmixed or vertex decomposable. Then we character...

We consider a class of hypergraphs called hypercycles and we show that a hypercycle $C_n^{d,alpha}$ is shellable or sequentially the Cohen--Macaulay if and only if $nin{3,5}$. Also, we characterize Cohen--Macaulay hypercycles. These results are hypergraph versions of results proved for cycles in graphs.

we consider a class of hypergraphs called hypercycles and we show that a hypercycle $c_n^{d,alpha}$ is shellable or sequentially the cohen--macaulay if and only if $nin{3,5}$. also, we characterize cohen--macaulay hypercycles. these results are hypergraph versions of results proved for cycles in graphs.

‎we introduce a generalization of the notion of‎ depth of an ideal on a module by applying the concept of‎ local cohomology modules with respect to a pair‎ ‎of ideals‎. ‎we also introduce the concept of $(i,j)$-cohen--macaulay modules as a generalization of concept of cohen--macaulay modules‎. ‎these kind of modules are different from cohen--macaulay modules‎, as an example shows‎. ‎also an art...

It is shown in this paper how a solution for a combinatorial problem obtained from applying the greedy algorithm is guaranteed to be optimal for those instances of the problem that, under an appropriate algebraic representation, satisfy the Cohen-Macaulay property known for rings and modules in Commutative Algebra. The choice of representation for the instances of a given combinatorial problem ...

Let (R,m) be a local Cohen-Macaulay ring whose m-adic completion R̂ has an isolated singularity. We verify the following conjecture of F.-O. Schreyer: R has finite Cohen-Macaulay type if and only if R̂ has finite Cohen-Macaulay type. We show also that the hypersurface k[[x0, . . . , xd]]/(f) has finite Cohen-Macaulay type if and only if k [[x0, . . . , xd]]/(f) has finite Cohen-Macaulay type, whe...

To every directed graph G one can associate a complex (G) consisting of directed subforests. This construction, suggested to us by R. Stanley, is especially important in the case of a complete double directed graph Gn, where it leads to studying some interesting representations of the symmetric group and corresponds (via Stanley-Reisner correspondence) to an interesting quotient ring. Our main ...

In this paper, we characterize the shellable complete $t$-partite graphs. We also show for these types of graphs the concepts vertex decomposable, shellable and sequentially Cohen-Macaulay are equivalent. Furthermore, we give a combinatorial condition for the Cohen-Macaulay complete $t$-partite graphs.