Codismantlability and projective dimension of the Stanley-Reisner ring of special hypergraphs (Q1754551)

Suppose that \({\mathcal{H}}\) is a hypergraph with the property that no two edges of \({\mathcal{H}}\) are comparable under inclusion (such a hypergraph is sometimes called a clutter). Then the family of independent subsets of vertices of \({\mathcal{H}}\) form a simplicial complex which is denoted by \(\Delta_{\mathcal{H}}\). In the paper [\textit{T. Bıyıkoğlu} and \textit{Y. Civan}, Electron. J. Comb. 21, No. 1, Research Paper P1.1, 17 p. (2014; Zbl 1305.13007)], the concept of a codominated vertex of a graph was introduced. The authors of the paper under review, generalize this concept to hypergraphs and call \({\mathcal{H}}\) codismantlable, when by consecutively deleting codominated vertices from \({\mathcal{H}}\) we can reach to an edgeless hypergraph. They prove that if \({\mathcal{H}}\) is a codismatlable hypergraph with no 5-cycles and all edges in a 3-cycle of \({\mathcal{H}}\) have cardinality 2, then \(\Delta_{\mathcal{H}}\) is vertex decomposable. This is a generalization of a result of the aforementioned paper. Also, the authors generalize the notion of a bouquet and the concepts of disjointness of bouquets in graphs from the paper [\textit{K. Kimura}, in: Harmony of Gröbner bases and the modern industrial society. Proceedings of the second CREST-SBM international conference. Hackensack, NJ: World Scientific. 153--168 (2012; Zbl 1338.13040)]. Then they use these concepts to present an upper bound on the projective dimension of edge ideals of vertex decomposable hypergraphs and find the projective dimension of some vertex decomposable hypergraphs satisfying certain conditions.