Abstract. It is not complicated to show that if the complete graph on n vertices has a triangular embedding, then it has at most n^n2(1/3-o(1)) nonisomorphic triangular embeddings in both orientable and nonorientable case. The lower bound 2^an for a constant a and for every admissible n was established by Korzhik and Voss. Better lower bound 2^an2 was proved by Bonnington, Grannell, Griggs and Siran for a constant a and for every n being in specified residue classes. Further, Grannell and Griggs proved lower bound n^an2 in the non-orientable case for a constant a and for infinite set of values n. In this paper, based on the approach of Grannell and Griggs, we give the same lower bound n^an2 also in in the orientable case for infinite set of values n. Though our constant a is smaller than 1/3, it is the same as in the non-orientable case in the above mentioned result of Grannell and Griggs.