ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph, let JGJ_G be its binomial edge ideal, and say that JGJ_G is of linear type when its Rees algebra is generated by the degree-one part in the standard sense. Linear-type conjecture for trees and unicyclic graphs. If GG is a tree or a unicyclic graph, then

JG is of linear type.J_G\text{ is of linear type}.

The source presents this as a statement to prove or disprove after noting that the preceding classification question is not true for trees; it gives no resolution.

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.