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

作者：Grannell M J^*; Knor M

来源：Journal of Combinatorial Theory - Series B, 2010, 100(2): 216-225.

DOI：10.1016/j.jctb.2009.08.001

• Steiner triple system
• Latin square
• Complete graph
• Triangular embedding

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).

• 出版日期2010-3