Table of Contents
Fetching ...

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

Rakesh Ghosh, S Selvaraja

Abstract

Let $G$ be a finite simple graph with edge ideal $I(G)$. For $q\ge 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 $\mathsf{MF}^q(G)$, called the $q$-matching-free complex, whose faces are those subsets $F\subseteq V(G)$ for which the induced subgraph $G[F]$ contains no matching of size $q$. We study $\mathsf{MF}^q(G)$ when $G=W(H)$ is a whisker graph. We first characterize purity. If $H$ is bipartite, then $\mathsf{MF}^q(G)$ is pure for all $q$. Otherwise, let $\ell$ denote the length of the smallest odd cycle of $H$ and set $n=|V(H)|$. Then $\mathsf{MF}^q(G)$ is pure if and only if $q<\lceil \ell/2\rceil$ or $q>n-\lfloor \ell/2\rfloor.$ We next determine the exact range of shellability. Let $m=\operatorname{girth}(H)$, with $m=\infty$ if $H$ is acyclic. Then $\mathsf{MF}^q(G)$ 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, $I(G)^{[q]}$ is Cohen-Macaulay for $1\le q\le\lfloor m/2\rfloor$ when $m<\infty$, and for all $1\le q\leν(G)$ when $m=\infty$. If $m$ is odd, then $I(G)^{[q]}$ is sequentially Cohen-Macaulay for $q=\lceil m/2\rceil$. We further obtain extremal characterizations: $\mathsf{MF}^{2}(G)$ is Cohen-Macaulay if and only if $H$ has no induced $3$-cycle, and $\mathsf{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.

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

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 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.
Paper Structure (6 sections, 28 theorems, 48 equations)

This paper contains 6 sections, 28 theorems, 48 equations.

Key Result

Theorem 1.1

Let $G = W(H)$ be a whisker graph with $|V(H)| = n$. If $H$ has no odd cycle, then $\mathsf{MF}^q(G)$ is pure. Otherwise, let $\ell$ be the length of the smallest odd cycle in $H$. Then $\mathsf{MF}^q(G)$ is pure if and only if $1 \le q < \lceil \frac{\ell}{2} \rceil$ or $n - \lfloor \frac{\ell}{2}

Theorems & Definitions (61)

  • Theorem 1.1: Theorem \ref{['pure-range']}
  • Theorem 1.2: Theorem \ref{['main']}
  • Theorem 1.3: Theorem \ref{['cm-chra']}
  • Theorem 1.4: Theorem \ref{['depth-formula']}
  • Conjecture 1.5: DRS24, Conjecture 6.3
  • Definition 2.1
  • Definition 2.2
  • Definition 2.3: J05, Definition 2.10
  • Remark 2.4
  • Lemma 2.5: Russ11, Lemma 3.4
  • ...and 51 more