Linear-type conjecture for trees and unicyclic graphs
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
References
2 papers in this index state this conjecture (2019–2022). The statement above is taken from the most recent of them; the others are arXiv:1911.10388.
Status
- Refuted: Marie Amalore Nambi and Neeraj Kumar. On Conjecture of Binomial Edge Ideals of Linear Type (arXiv, 2024) https://arxiv.org/abs/2406.05960
Source: Priya Das, “Recent results on homological properties of binomial edge ideal of graphs”, arXiv:2209.01201 (2023).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.