Back to Search Start Over

Steiner Triple Systems, Pinched Surfaces, and Complete Multigraphs.

Authors :
Archdeacon, Dan
Source :
Graphs & Combinatorics. Nov2014, Vol. 30 Issue 6, p1351-1361. 11p.
Publication Year :
2014

Abstract

We consider complete multigraphs $${K_n^m}$$ on n vertices with every pair joined by m edges. We embed these graphs to triangulate $${S_n^k}$$ , a pinched surface with n pinch points each having k sheets. These embeddings have a vertex at each pinch point and any two sheets at a pinch point have the same number of edges. Moreover, we want to 2 m-color the faces such that each color class is a Steiner triple system. These embeddings generalize in two ways biembeddings of Steiner triple systems, the case m = 1, k = 1 of simple graphs in surfaces without pinch points. [ABSTRACT FROM AUTHOR]

Details

Language :
English
ISSN :
09110119
Volume :
30
Issue :
6
Database :
Academic Search Index
Journal :
Graphs & Combinatorics
Publication Type :
Academic Journal
Accession number :
98862011
Full Text :
https://doi.org/10.1007/s00373-013-1348-2