Linear-type conjecture for trees and unicyclic graphs
Statement
Let be a graph, let be its binomial edge ideal, and say that 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 is a tree or a unicyclic graph, then
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.