Conjecture on linear type and symbolic Rees algebras of binomial edge ideals
Statement
Let be a finite simple graph, let denote its binomial edge ideal, and let denote the cycle graph on vertices. Let be the Rees algebra of , and let denote the symbolic Rees algebra of . Conjecture. If is a tree or a unicyclic graph, then is of linear type. Moreover,
These claims arise from experimental evidence in the study of binomial edge ideals and their Rees algebras. The surrounding discussion also asks for a classification of all bipartite graphs whose binomial edge ideals are of linear type; the conjectured assertions provide two proposed classes of examples and a symbolic-Rees-algebra equality, with no resolution supplied here.
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.