ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected weakly closed graph, let S=K[x1,…,xn,y1,…,yn]S=K[x_1,\ldots,x_n,y_1,\ldots,y_n], and let JGJ_G be its binomial edge ideal. Let ℓ\ell denote the length of the longest induced path of GG. Regularity conjecture for weakly closed graphs. If the longest induced path of GG has length ℓ\ell, then

reg⁡(S/JG)=ℓ.\operatorname{reg}(S/J_G)=\ell.

The claim extends the corresponding result for connected closed graphs and the authors establish it for trees, where the relevant graphs are precisely caterpillar trees; the supplied text reports that the general weakly closed-graph case is motivated by computer experiments and leaves it as a conjecture.

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.