Saeedi and Kiani's regularity bound by maximal cliques
Statement
Let be a graph, let , and let be its binomial edge ideal. Denote by the number of maximal cliques of . Saeedi and Kiani's conjecture. The Castelnuovo–Mumford regularity satisfies
The bound is known for closed graphs, and the paper proves it for chordal graphs. The statement is presented as a conjecture for arbitrary graphs in the supplied text, with no resolution beyond the chordal case established there.
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.