ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a simple graph on vertex set V(G)=[n]V(G)=[n], let R=k[x1,…,xn]R=\Bbbk[x_1,\ldots,x_n], and let I(Gd)I(G^d) be the edge ideal of the dd-th power of GG, where dd is a positive integer. The Castelnuovo–Mumford regularity is denoted by reg⁡\operatorname{reg}. Monotonicity conjecture. For every simple graph GG and every positive integer dd,

reg⁡(R/I(Gd))≥reg⁡(R/I(Gd+1)).\operatorname{reg}\left(R/I(G^d)\right)\geq \operatorname{reg}\left(R/I(G^{d+1})\right).

The conjecture proposes that the regularity of edge ideals of successive graph powers is weakly decreasing. The paper proves this behavior for powers of forests and computes the regularity for powers of cycles, while the assertion for arbitrary simple graphs is suggested based on computations.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.