Smoothness in binomial edge ideals (Q515434)

In the paper under review, the author studies singularity or smoothness of the algebraic set associated to the binomial edge ideal of a graph. Some of these algebraic sets are irreducible and some of them are reducible. If every irreducible component of the algebraic set is smooth the graph is called an edge smooth graph, otherwise it is called an edge singular graph. By computations on the Jacobian matrix of the binomial edge ideal, the author proves that complete graphs are edge smooth. Moreover he introduces two conditions such that the graph \(G\) is edge singular if and only if it satisfies these conditions. It is also shown that cycles and most of trees are edge singular. In addition, it is proved that complete bipartite graphs are edge smooth.