Cohen-Macaulayness of squarefree powers of edge ideals of whisker graphs
Rakesh Ghosh, S Selvaraja

TL;DR
This paper investigates the Cohen-Macaulayness and shellability of squarefree powers of edge ideals of whisker graphs, providing characterizations based on graph properties like bipartiteness, cycles, and girth.
Contribution
It offers new characterizations of purity, shellability, and Cohen-Macaulayness for squarefree powers of edge ideals in whisker graphs, linking algebraic properties to graph structures.
Findings
$ ext{MF}^q(G)$ is pure if $H$ is bipartite or under certain cycle length conditions.
$ ext{MF}^q(G)$ is shellable within a specific range depending on girth or independence number.
$I(G)^{[q]}$ is Cohen-Macaulay or sequentially Cohen-Macaulay under conditions related to cycles and girth.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCommutative Algebra and Its Applications · Advanced Combinatorial Mathematics · Polynomial and algebraic computation
