Steinitz' theorem analogue for two-dimensional Cohen-Macaulay complexes (Q1291064)

\textit{R. P. Stanley} [Combinatorics and commutative algebra. 2nd ed. (1996; Zbl 0838.13008)] presents a series of very nice and surprizing applications of commutative algebra techniques to some combinatorial problems in algebra and geometry. The authors of the present paper study the problem of the combinatorial characterization of graphs by Cohen-Macaulay simplicial complexes. This problem is an analogue of the well-known Steinitz' theorem on the characterization of graphs by three-dimensional polytopes. The authors prove the following theorem: Let \(G\) be a finite simple graph. Then \(G\) is the graph of a two-dimensional simplicial complex \(\Delta\) that is Cohen-Macaulay over an arbitrary field if and only if the following conditions hold: (1) \(G\) is 2-conected, (2) every edge of \(G\) is contained in at least one triangle, (3) every two triangles \(C_1\) and \(C_2\) in \(G\) with \(C_1\cap C_2\) being a singleton are contained in a fan, (4) the simplicial dual \(G^*\) of \(G\) is connected, and (5) every cycle in \(G^*\) is an oriented sum of toric cycles and axised cycles. They give an example of a graph that cannot be the graph of any Cohen-Macaulay simplicial complex over a field of characteristic 2 but is the graph of a two-dimensional Cohen-Macaulay simplicial complex over a field of characteristic \(\neq 2\). Also, they give an example of a graph that can be the graph of a Cohen-Macaulay simplicial complex but can never be the graph of a shellable simplicial complex.