Binomial edge ideals and bounds for their regularity (Q2038884)

The study of algebraic invariants of (binomial) edge ideals in terms of combinatorial properties of the associated graph has a long tradition in Combinatorial Commutative Algebra. Let \(S=K[x_1,\dots,x_n]\) be the standard polynomial ring, with \(K\) a field. Let \(G\) be a finite simple graph on vertex set \([n]:=\{1,2,\dots,n\}\), \(J_G\) the binomial edge ideal associated to \(G\) and \(c(G)\) be the number od maximal cliques in \(G\). In this paper, the author focuses its attention to the following conjecture due to Madani and Kiani:\\ \((*)\): Let \(G\) be a simple graph on \([n]\). Then, \(\text{reg}(S/J_G)\le c(G)\). In particular, it proves conjecture \((*)\) for quasi-block graphs, semi-block graphs and gives a new proof for the class of chordal graphs. Finally, the regularity of Jahangir graphs is computed. It would be nice to settle conjecture \((*)\) in full generality.