Monotonicity conjecture for the regularity of graph-power edge ideals
Statement
Let be a simple graph on vertex set , let , and let be the edge ideal of the -th power of , where is a positive integer. The Castelnuovo–Mumford regularity is denoted by . Monotonicity conjecture. For every simple graph and every positive integer ,
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.