Cohen-Macaulayness of squarefree powers of edge ideals of whisker graphs

Abstract

Let G be a finite simple graph with edge ideal I(G). For q 1, the q-th squarefree power I(G)[q] is generated by products of q pairwise disjoint edges of G. It is the Stanley-Reisner ideal of a simplicial complex MFq(G), called the q-matching-free complex, whose faces are those subsets F⊂eq V(G) for which the induced subgraph G[F] contains no matching of size q. We study MFq(G) when G=W(H) is a whisker graph. We first characterize purity. If H is bipartite, then MFq(G) is pure for all q. Otherwise, let denote the length of the smallest odd cycle of H and set n=|V(H)|. Then MFq(G) is pure if and only if q< /2 or q>n- /2. We next determine the exact range of shellability. Let m=girth(H), with m=∞ if H is acyclic. Then MFq(G) is shellable for \[ 1 q cases m/2, & if m<∞,\\ (G), & if m=∞. cases \] Consequently, I(G)[q] is Cohen-Macaulay for 1 q m/2 when m<∞, and for all 1 q(G) when m=∞. If m is odd, then I(G)[q] is sequentially Cohen-Macaulay for q= m/2. We further obtain extremal characterizations: MF2(G) is Cohen-Macaulay if and only if H has no induced 3-cycle, and MF\,n-1(G) is Cohen-Macaulay if and only if H is acyclic. Finally, we compute the depth of I(G)[q] for whisker graphs and verify a conjecture on the depth of squarefree powers of whisker cycles in the relevant range.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…