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

Authors:
M. J. Grannell;M. Knor
Affiliations:
Department of Mathematics and Statistics, The Open University, Walton Hall, Milton Keynes MK7 6AA, United Kingdom;Department of Mathematics, Faculty of Civil Engineering, Slovak University of Technology, Radlinského 11, 813 68 Bratislava, Slovakia
Venue:
Journal of Combinatorial Theory Series B
Year:
2010

Citing 8
Cited 1

Topological graph theory

Topological graph theory
Exponential families of non-isomorphic triangulations of complete graphs

Journal of Combinatorial Theory Series B
On the number of nonisomorphic orientable regular embeddings of complete graphs

Journal of Combinatorial Theory Series B
Exponential families of non-isomorphic non-triangular orientable genus embeddings of complete graphs

Journal of Combinatorial Theory Series B
Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs

Journal of Combinatorial Theory Series B
A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs

Journal of Combinatorial Theory Series B
Recursive constructions for triangulations

Journal of Graph Theory
A constraint on the biembedding of Latin squares

European Journal of Combinatorics

Triangular Embeddings

Journal of Graph Theory

Quantified Score

Hi-index	0.00

Visualization

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