Matsuda–Murai's characterization of maximal regularity for binomial edge ideals
Statement
Let be a finite simple graph, with denoting its number of vertices and its binomial edge ideal in . Matsuda–Murai's conjecture.
if and only if is a path graph on vertices. The claim concerns equality in the general upper bound for binomial edge ideals; the source does not state whether it has been resolved.
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.