Madani–Kiani's maximal-clique regularity conjecture for binomial edge ideals
Let be a simple graph, let be the polynomial ring used to define its binomial edge ideal , and let be the number of maximal cliques of . Madani–Kiani's conjecture.
References
Status
- Solved: M. Rouzbahani Malayeri, S. Saeedi Madani, and D. Kiani. A proof for a conjecture on the regularity of binomial edge ideals (arXiv (math.AC, math.CO), arXiv:2007.09959, 2020) https://arxiv.org/abs/2007.09959
Source: Priya Das, “Recent results on homological properties of binomial edge ideal of graphs”, arXiv:2209.01201 (2023).
Progress summary
A paper claims the proposed bound has been proved for every graph, but the scan found no independent verification.
Madani–Kiani conjectured that the regularity of a graph's binomial edge ideal is at most its number of maximal cliques. The conjecture was originally open in general, despite many established special cases.
Known results
- Closed graphs: (Ene, Herzog, Hibi, 2012).
- Chordal graphs: the conjectured bound holds (Ene, Herzog, Hibi, 2018).
- Further special classes include generalized block, fan, -free, block, and semi-block graphs.
All-graph proof and 2022 confirmation
Malayeri, Saeedi Madani, and Kiani claim an all-graph proof (publication date not stated in the scan): they establish the sharper inequality , where , implying the conjecture. A 2022 survey presents this result as resolving the conjecture. No retrieved source reports a gap, retraction, or independent verification.
Current status (as of September 2026): An all-graph proof is claimed, with the sharper bound , but the resolution remains unverified in this report.
Solutions 0
No solutions have been posted yet.