加载中…
As a higher analogue of the edge ideal of a graph, we study the -connected ideal . This is the monomial ideal generated by the connected subsets of size . For chordal graphs, we show that has a linear resolution iff the tree is -gap-free, and that this is equivalent to having linear quotients. We then show that if is any gap-free and -claw-free graph, then has linear quotients and, hence, linear resolution.

生成讲解博客的中文版本

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