加载中…
Let be a finite graph and its edge ideal. We give a full description of the Stanley–Reisner complex of the polarization of , naturally introducing the tools of Stanley–Reisner theory in the study of the algebraic behaviour of powers of edge ideals. As an application, we demonstrate how Reisner’s criterion can be applied directly to check if is Cohen–Macaulay. We can show that if belongs to the class of finite graphs which consists of cycles, whisker graphs, trees, connected chordal graphs and connected Cohen–Macaulay bipartite graphs, then the square is Cohen–Macaulay if and only if either is the pentagon, the cycle of length , or consists of exactly one edge.

生成讲解博客的中文版本

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