Cohen–Macaulayness classification for Inc(N)-invariant chains of edge ideals

Let kk be a field, let Rm=k[x1,…,xm]R_m=k[x_1,\ldots,x_m], and let I(Cn)⊆RnI(C_n)\subseteq R_n be the edge ideal of the cycle graph CnC_n. For n≥4n\ge 4 and r≥0r\ge 0, set In,r=Inc⁡(N)n,n+r(I(Cn))⊆Rn+rI_{n,r}=\operatorname{Inc}(\mathbb{N})_{n,n+r}(I(C_n))\subseteq R_{n+r}. Determine whether Rn+r/In,rR_{n+r}/I_{n,r} is Cohen–Macaulay. The conjectured complete classification is Rn+r/In,rR_{n+r}/I_{n,r} is Cohen–Macaulay if and only if r≥⌊n−42⌋r\ge \left\lfloor\frac{n-4}{2}\right\rfloor and r≠n−4r\ne n-4.

References

Primary source

arXiv

Progress summary

Refreshed
Claimed progress

A September 2026 paper settles several important families but leaves the main cyclic case as a conjecture.

The problem seeks a complete Cohen–Macaulayness classification for chains of edge ideals invariant under order-preserving injections. The reported work resolves several families and reduces the cyclic case to a precise conjectural criterion.

Known results

  • Exact criteria are proved for line graphs.
  • Unconditional results cover several complementary graph families.

September 3, 2026 development

A reported paper proves the line-graph criteria and unconditional results for complementary families, while conjecturing the full cyclic classification for r≥⌊(n−4)/2⌋r \ge \lfloor (n-4)/2 \rfloor and r≠n−4r \ne n-4. The cyclic classification is supported by computational and structural evidence but remains unverified.

Current status (as of September 2026): Several graph families are claimed classified, but the cyclic case for r≥⌊(n−4)/2⌋r \ge \lfloor (n-4)/2 \rfloor and r≠n−4r \ne n-4 remains conjectural.

Sources

Solutions 0

No solutions have been posted yet.