The reconstruction conjecture and edge ideals (Q952662): Difference between revisions

In this paper the authors take a new look at the Reconstruction Problem by trying to reconstruct from the deck of vertex-deleted subgraphs of \(G\) several algebraic properties of the edge ideal of \(G\), which is the ideal \(I(G)\) of the polynomial ring \(R=k[x_1,x_2,\ldots,x_n]\), generated by the square-free monomials \(x_ix_j\) where \(\{x_i,x_j\}\) is an edge of \(G\). These properties include the Krull dimension, the Hilbert function and all the graded Betti numbers \(\beta_{i,j}\), where \(j<n\). This is an interesting paper which could provide a new take on the Reconstruction Problem. For example, the authors show that a special class of Cohen-Macauley graphs (that is, graphs for which \(R/I(G)\) is Cohen-Macauley) is reconstructible by showing that a graph \(G\) obtained by attaching an endvertex to every vertex of some arbitrary graph \(G'\) is reconstructible, not a difficult graph reconstruction result. Maybe, as the authors themselves remark, results could flow in the opposite direction and reconstructing such algebraic parameters could help in attacking the Reconstruction Problem.