REVIEW 1 cited by
Upper bounds for the regularity of powers of edge ideals of graphs
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
abstract
Let $G$ be a finite simple graph and $I(G)$ denote the corresponding edge ideal. In this paper, we obtain upper bounds for the Castelnuovo-Mumford regularity of $I(G)^q$ in terms of certain combinatorial invariants associated with $G$. We also prove a weaker version of a conjecture by Alilooee, Banerjee, Beyarslan and H\`a on an upper bound for the regularity of $I(G)^q$ and we prove the conjectured upper bound for the class of vertex decomposable graphs. Using these results, we explicitly compute the regularity of $I(G)^q$ for several classes of graphs.
Forward citations
Cited by 1 Pith paper
-
Regularity of Edge Ideals Via Suspension
For every bipartite graph G and every s >= 2, the Castelnuovo-Mumford regularity of the s-th power of its edge ideal is at most 2s + reg(I(G)) - 2, and this bound is tight.
Discussion (0). Continue with ORCID to comment.