Computing Matveev's complexity of non-orientable 3-manifolds via crystallization theory (Q1886717)

For each compact 3-manifold \(M^3\), Matveev's complexity \(c(M^3)\) of \(M^3\) is defined as the minimal number of vertices of any simple spine of \(M^3\). This paper looks at Matveev's complexity from a different point of view, which makes use of particular edge-coloured graphs, called crystallizations. For closed non-orientable 3-manifolds, the author in [Acta Appl. Math. 54, No.~1, 75--97 (1998; Zbl 0913.57011)] gave a classification in terms of crystallizations and \textit{G. Amendola} and \textit{B. Martelli} [Topology Appl. 133, No.~2, 157--178 (2003; Zbl 1029.57018)] computed Matveev's complexity of those manifolds. In the paper under review, the author gives an improvement of Amendola's and Martelli's result.