Saeedi and Kiani's regularity bound by maximal cliques
Let be a graph, let , and let be its binomial edge ideal. Denote by the number of maximal cliques of . Saeedi and Kiani's conjecture. The Castelnuovo–Mumford regularity satisfies
The bound is known for closed graphs, and the paper proves it for chordal graphs. The statement is presented as a conjecture for arbitrary graphs in the supplied text, with no resolution beyond the chordal case established there.
References
- M. Rouzbahani Malayeri, S. Saeedi Madani and D. Kiani, “Regularity of binomial edge ideals of chordal graphs”, arXiv:1810.03119 (2018).
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.