Cohen-Macaulay type of the face poset of a plane graph (Q1334939)

Cohen-Macaulay posets are defined using the concept of a Stanley-Reisner ring. For such a poset its Cohen-Macaulay type, \(\text{type}_ k(P)\), is defined. Now, a finite plane graph \(G\) is considered; loops and multiple edges are admitted. The symbols \(P_ 0\), \(P_ 1\), \(P_ 2\) denote its vertex set, edge set and face set, respectively. The poset \(P(G)= P_ 0\cup P_ 1\cup P_ 2\) is studied; where \(x\prec y\) if and only if \(x\in P_ i\), \(y\in P_ j\) with \(i< j\) and \(x\) is incident to \(y\) in \(G\). The main theorem states a formula for \(\text{type}_ k(P(G))\). This formula is in terms of \(\delta_ G(v)\) and \(\nu_ G(v)\), where \(\delta_ G(v)\) is the number of connected components of the graph obtained from \(G\) by deleting the vertex \(v\) and \(\nu_ G(v)\) is the number of loops incident to \(v\).