The splitting number of the complete graph in the projective plane
type: Item
instance of: scholarly article
title: The splitting number of the complete graph in the projective plane
zbMATH Open document ID: 0628.05027
DOI: 10.1007/BF01788557
author: Nora Hartsfield
published in: Graphs and Combinatorics
publication date: 1987-01-01T00:00:00Z
review text: 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\).
reviewed by: Ján Plesník
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C99
zbMATH DE Number: 4021167
zbMATH Keywords: splitting number
zbMATH Keywords: vertex identifications
zbMATH Keywords: projective plane
zbMATH Keywords: complete graph
MaRDI profile type: Publication
cites work: The splitting number of the complete graph
cites work: Maps of m-pires on the projective plane
cites work: Q4773723
full work available at URL: https://doi.org/10.1007/bf01788557
OpenAlex ID: W2084618386
description: scientific article; zbMATH DE number 4021167