paper

Squarefree Powers of Edge Ideals under Graph Joins and Cones

arXiv:2607.04964

Abstract

For , the -th squarefree power of the edge ideal of a graph is generated by the squarefree monomials supported on -matchings of ; it is the Stanley--Reisner ideal of the complex , where denotes matching number. We prove a general formula for the matching number of an arbitrary graph join, \[ ν(G\ast H) = \min\Big(ν(G)+|V(H)|,\ \ ν(H)+|V(G)|,\ \ \Big\lfloor\tfrac{|V(G)|+|V(H)|}{2}\Big\rfloor\Big), \] via the Tutte--Berge formula, and use it to decompose for arbitrary graphs . Specializing to the wheel graph , we determine the Krull dimension and height of exactly for all , , and -- combining our matching-number computations with a recent Tutte-type Cohen-Macaulayness criterion of Ficarra and Moradi -- prove that at the \emph{top} squarefree power , the ideal is literally the squarefree Veronese ideal, so that is Cohen-Macaulay with \[ {\rm dim} = {\rm depth} = {\rm reg}\big(R/I(\mathcal{W}_n)^{[ν(\mathcal{W}_n)]}\big) = 2\Big\lceil\frac n2\Big\rceil-1. \] This resolves all four classical invariants at the top power, and confirms there the pattern depth that our computational data (now extended to , every valid ) suggests holds throughout. We prove a general depth formula for squarefree powers of cone graphs, via a Betti-splitting exact sequence, that reduces this pattern to two more tractable statements about the underlying cycle alone; both are verified computationally in every case checked but left open in general.