Binomial edge ideals of regularity 3 (Q1794063)

Let \(G\) be a finite simple graph with vertex set \([n]\) and edge set \(E(G)\). Also, let \(S=\mathbb{K}[x_1, \ldots, x_n, y_1, \ldots, y_n]\) be the polynomial ring over a field \(\mathbb{K}\). Then the binomial edge ideal of \(G\) in \(S\), denoted by \(J_G\) is generated by binomials \(f_{ij}=x_iy_j-x_jy_i\), where \(i<j\) and \(\{i,j\}\in E(G)\). Also, one could see this ideal as an ideal generated by a collection of \(2\)-minors of a \((2\times n)\)-matrix whose entries are all indeterminate. In [\textit{D. Kiani} et al., Electron. J. Comb. 19, No. 2 Research Paper P44, 6 p. (2012; Zbl 1262.13012)] all binomial edge ideals, as well as their initial ideals, with regularity \(2\) were characterized. In the paper under review, the author characterize all graphs whose binomial edge ideals, as well as their initial ideals, have regularity \(3\). Consequently, they characterize all graphs \(G\) such that \(J_G\) is extremal Gorenstein. Theses characterizations are consequences of formulas obtained in Theorem 2.1 for the regularity of the binomial edge ideal of the join product of two graphs. This theorem states that if \(G_1\) and \(G_2\) are graphs on disjoint vertex sets, not both complete, then \[ \text{reg}(J_{G_1\ast G_2}) = \max\{\text{reg}(J_{G_1}), \text{reg}(J_{G_2}), 3\}. \] Moreover, for every term order \(<\) we have \[ \text{reg}(\text{in}_<J_{G_1\ast G_2}) = \max\{\text{reg}(\text{in}_<J_{G_1}), \text{reg}(\text{in}_<J_{G_2}), 3\}. \] Theses formulas are also used to discuss some open problems in the literature. In particular, the authors disprove a conjecture in [\textit{F. Chaudhry} et al., An. Ştiinţ. Univ. ``Ovidius'' Constanţa, Ser. Mat. 24, No. 2, 149--158 (2016; Zbl 1389.13043)] on the regularity of weakly closed graphs.