Combinatorial Embeddings and Representations

Psomas, Constantinos (2012). Combinatorial Embeddings and Representations. PhD thesis The Open University.

DOI: https://doi.org/10.21954/ou.ro.0000f1d5

Abstract

Topological embeddings of complete graphs and complete multipartite graphs give rise to combinatorial designs when the faces of the embeddings are triangles. In this case, the blocks of the design correspond to the triangular faces of the embedding. These designs include Steiner, twofold and Mendelsohn triple systems, as well as Latin squares. We look at construction methods, structural properties and other problems concerning these cases.

In addition, we look at graph representations by Steiner triple systems and by combinatorial embeddings. This is closely related to finding independent sets in triple systems. We examine which graphs can be represented in Steiner triple systems and combinatorial embeddings of small orders and give several bounds including a bound on the order of Steiner triple systems that are guaranteed to represent all graphs of a given maximum degree. Finally, we provide an enumeration of graphs of up to six edges representable by Steiner triple systems.

Viewing alternatives

Download history

Metrics

Public Attention

Altmetrics from Altmetric

Number of Citations

Citations from Dimensions

Item Actions

Export

About

Recommendations