Bolognini–Macchia–Strazzanti's Cohen–Macaulayness conjecture for binomial edge ideals
Bolognini–Macchia–Strazzanti's Cohen–Macaulayness conjecture for binomial edge ideals
Let be a graph, and let denote its binomial edge ideal. The graph is accessible if its cutsets form an accessible system.
Bolognini–Macchia–Strazzanti's conjecture. is Cohen–Macaulay if and only if is accessible.
This conjecture proposes a combinatorial characterization of Cohen–Macaulay binomial edge ideals. The source presents it as a conjecture of Bolognini, Macchia, and Strazzanti; its resolution is not specified here.
Sources & referencesView supporting material
Primary source
Buddhadev Hajra and Rajib Sarkar, “On binomial edge ideals of corona of graphs”, arXiv:2503.12114 (2025).
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.