The splitting number of the complete graph in the projective plane (Q1092916)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The splitting number of the complete graph in the projective plane |
scientific article; zbMATH DE number 4021167
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The splitting number of the complete graph in the projective plane |
scientific article; zbMATH DE number 4021167 |
Statements
The splitting number of the complete graph in the projective plane (English)
0 references
1987
0 references
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\).
0 references
splitting number
0 references
vertex identifications
0 references
projective plane
0 references
complete graph
0 references
