Cohen-Macaulayness of squarefree powers of edge ideals of whisker graphs
arXiv:2603.02824
Abstract
Let be a finite simple graph with edge ideal . For , the -th squarefree power is generated by products of pairwise disjoint edges of . It is the Stanley-Reisner ideal of a simplicial complex , called the -matching-free complex, whose faces are those subsets for which the induced subgraph contains no matching of size . We study when is a whisker graph. We first characterize purity. If is bipartite, then is pure for all . Otherwise, let denote the length of the smallest odd cycle of and set . Then is pure if and only if or We next determine the exact range of shellability. Let , with if is acyclic. Then is shellable for \[ 1\le q\le \begin{cases} \lceil m/2\rceil, & \text{if } m<\infty,\\ ν(G), & \text{if } m=\infty. \end{cases} \] Consequently, is Cohen-Macaulay for when , and for all when . If is odd, then is sequentially Cohen-Macaulay for . We further obtain extremal characterizations: is Cohen-Macaulay if and only if has no induced -cycle, and is Cohen-Macaulay if and only if is acyclic. Finally, we compute the depth of for whisker graphs and verify a conjecture on the depth of squarefree powers of whisker cycles in the relevant range.
19 pages. Comments are welcome