Rees algebra and special fiber ring of binomial edge ideals of closed graphs (Q2135643)

In the present context, a graph, \(G\), is called a closed graph if the generators of the binomial edge ideal of the graph, \(J_G\), form a quadratic Gröbner basis, with respect to some ordering of the vertices. In the first main result, the author shows that if \(G\) has no isolated vertices and is a closed graph, then the regularity of the Rees algebra of the binomial edge ideal of the graph, \(\mathcal{R}(J_G)\), is equal to the number of vertices minus the number of connected components (Theorem 3.3). In Theorem 3.5, the author shows that if \(H\) is any induced subgraph of \(G\), then \[\operatorname{reg} \mathcal{R}(J_H)\leq \operatorname{reg} \mathcal{R}(J_G).\] Turning to the special fiber ring, \(\mathcal{F}(J_G)\), in Theorem 4.1, the author proves that the Koszul and Cohen-Macaulay properties hold for \(\mathcal{F}(J_G)\) and computes the analytic spread of \(J_G\). In Theorem 4.4, under similar assumptions as above, he shows that \(\operatorname{reg} \mathcal{F}(J_G)\) is equal to the number of vertices minus twice the number of connected components. Finally, in Theorem 4.6, similarly to Theorem 3.5, a lower bound for \(\operatorname{reg} \mathcal{F}(J_G)\) is given, in terms of an induced subgraph of \(G\).