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.

in this paper, we introduce a subclass of chordal graphs which contains $d$-trees and show that their complement are vertex decomposable and so is shellable and sequentially cohen-macaulay.

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.

Let G be a simple undirected graph on n vertices, and let I(G) ⊆ R = k[x1, . . . , xn] denote its associated edge ideal. We show that all chordal graphs G are sequentially Cohen-Macaulay; our proof depends upon showing that the Alexander dual of I(G) is componentwise linear. Our result complements Faridi’s theorem that the facet ideal of a simplicial tree is sequentially Cohen-Macaulay and impl...