A lower bound for the number of orientable triangular embeddings of some complete graphs

Grannell, M. J. and Knor, M. (2010). A lower bound for the number of orientable triangular embeddings of some complete graphs. Journal of Combinatorial Theory, Series B, 100(2) pp. 216–225.

DOI: https://doi.org/10.1016/j.jctb.2009.08.001

Abstract

We prove that, for a certain positive constant a and for an infinite set of values of n, the number of nonisomorphic face 2-colourable triangular embeddings of the complete graph K_n in an orientable surface is at least n^an2.

Viewing alternatives

Metrics

Item Actions

Export

You can export this page using these formats Digital Object Identifier - DOI

About

• Item ORO ID
• 21315
• Item Type
• Journal Item
• ISSN
• 0095-8956
• Keywords
• Steiner triple system; Latin square; Complete graph; Triangular embedding
• Academic Unit or School
• Faculty of Science, Technology, Engineering and Mathematics (STEM) > Mathematics and Statistics
  Faculty of Science, Technology, Engineering and Mathematics (STEM)
• Depositing User
• Colin Smith