For , the -independence complex of a graph is the collection of all such that each connected component of the induced subgraph has at most vertices. The topology of is intimately related to the combinatorial property of . In this article, we consider the Stanley-Reisner ideal of and focus on its algebraic properties. We prove that for a chordal graph and for all where denotes the induced matching number of the corresponding hypergraph of , and , and stand for the regularity, projective dimension, and big height, respectively. As a consequence of the above results, we combinatorially characterize when the Stanley-Reisner ideal of the -independence complex of a chordal graph has a linear resolution as well as when it satisfies the Cohen-Macaulay property. The above formulas and their consequences can be seen as a nice generalization of the classical results corresponding to the edge ideals of chordal graphs.

生成讲解博客的中文版本

生成AI智能校验的中文版本