ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph, let JGJ_G be its binomial edge ideal, and let c(G)c(G) be the number of maximal cliques of GG. Seyed Fakhari–Kiani's conjecture.

\reg(JG)≤c(G)+1.\reg(J_G)\leq c(G)+1.

This conjecture is proposed as an upper bound for the regularity of binomial edge ideals in terms of the maximal-clique structure of the graph. The source does not provide evidence there that the conjecture 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 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.