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

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 a n 2 .