Jayanthan–A R conjecture on linear type binomial edge ideals
Statement
Let be a graph, let , and let
be its binomial edge ideal. An ideal is of linear type when its symmetric algebra is naturally isomorphic to its Rees algebra, . Jayanthan–A R conjecture. If is a tree or a unicyclic graph, then is of linear type. This conjecture proposes a combinatorial characterization of a class of binomial edge ideals analogous to the known characterization for ordinary edge ideals; its resolution status is not specified in the source.
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.