The splitting number of the complete graph in the projective plane
A formula is derived for the minimum number of vertex identifications performed in a suitable graph embeddable in the projective plane to obtain a given complete graph. This number is 0 if the number of vertices \(n<7\), 2 if \(n=7\) and \(\lceil (n-3)(n-4)/6\rceil -1\) if \(n>7\).
scientific article; zbMATH DE number 4021167