Jayanthan–Raghavan conjecture on linear type binomial edge ideals
Statement
Let be a graph, and let its binomial edge ideal be the ideal generated by the binomials associated to the edges of . A graph is unicyclic if it has exactly one cycle. Jayanthan–Raghavan's conjecture. If is a tree or a unicyclic graph, then its binomial edge ideal is of linear type. This conjecture proposes a graph-theoretic characterization of linear type for binomial edge ideals; the supplied source does not provide evidence of a resolution, so its status remains open.
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.