ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph, let S=K[x1,…,xn,y1,…,yn]S={\mathbb K}[x_1,\ldots,x_n,y_1,\ldots,y_n], and let JGJ_G be its binomial edge ideal. Denote by c(G)c(G) the number of maximal cliques of GG. Saeedi and Kiani's conjecture. The Castelnuovo–Mumford regularity satisfies

reg⁡SJG≤c(G).\operatorname{reg}\dfrac{S}{J_G}\leq c(G).

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 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.