On a regularity-conjecture of generalized binomial edge ideals (Q6937002)

The paper addresses the problem concerning the Castelnuovo-Mumford regularity of generalized binomial edge ideals, a class of binomial ideals introduced by \textit{J. Rauh} [Adv. Appl. Math. 50, No. 3, 409--414 (2013; Zbl 1263.13033)] that extends binomial edge ideals. Regularity bounds for such ideals are important because they control the complexity of minimal free resolutions and connect to the combinatorics of the underlying graph. A conjecture by \textit{S. S. Madani} and \textit{D. Kiani} [Electron. J. Comb. 20, No. 1, Research Paper P48, 13 p. (2013; Zbl 1278.13007)] proposed an upper bound for the regularity of generalized binomial edge ideals, which was solved for the chordal graphs by \textit{A. Kumar} [J. Algebra 546, 357--369 (2020; Zbl 1433.13013)]. The authors settle this conjecture in full generality and, in fact, they obtain a strictly stronger upper bound. They introduce a refined notion of an \(r\)-compatible map and show that it yields a uniform upper bound given combinatorially, in terms of the maximal size of a clique-disjoint edge set of the graph. This bound improves all previously known results, including those for chordal graphs and for the classical binomial edge ideals. The authors also construct an infinite class of block graphs for which their bound is attained. Overall, the paper gives a complete solution to the regularity conjecture, providing a combinatorial bound.