Papers
Topics
Authors
Recent
Search
2000 character limit reached

Cohen-Macaulay squares of edge ideals

Published 5 May 2025 in math.AC | (2505.02605v1)

Abstract: Let $G$ be a finite graph and $I(G)$ its edge ideal. The question in which we are interested is when the square $I(G)2$ is Cohen--Macaulay. Via the polarization technique together with Reisner's criterion, it is shown that, if $G$ belongs to the class of finite graphs which consists of cycles, whisker graphs, trees, connected chordal graphs and connected Cohen--Macaulay bipartite graphs, then the square $I(G)2$ is Cohen--Macaulay if and only if either $G$ is the pentagon, the cycle of length $5$, or $G$ consists of exactly one edge.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.