Nevo–Peeva conjecture on eventual linear resolutions of gapfree graph edge ideals
Nevo–Peeva conjecture on eventual linear resolutions of gapfree graph edge ideals
Let be a finite simple graph with vertex set , let be a polynomial ring over a field , and let be the edge ideal generated by for . The graph is gapfree if any two disjoint edges have an edge meeting both of them. Nevo–Peeva's conjecture. If is gapfree, then has linear resolution for all sufficiently large integers . This conjecture is known in several special cases, including certain small-regularity and random-graph settings, but remains unresolved in general.
Sources & referencesView supporting material
Primary source
Nursel Erey, Sara Faridi, Tài Huy Hà, Takayuki Hibi, Selvi Kara and Susan Morey, “Gapfree graphs and powers of edge ideals with linear quotients”, arXiv:2412.06467 (2024).
Additional references
2 papers in this index state this conjecture (2020–2024). The statement above is taken from the most recent of them; the others are arXiv:2003.05419.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.