On the number of triangular embeddings of complete graphs and complete tripartite graphs |
| |
| Authors: | M. J. Grannell M. Knor |
| |
| Affiliation: | 1. Department of Mathematics and Statistics, the Open University, , United Kingdom;2. Department of Mathematics, Faculty of Civil Engineering, Slovak University of Technology, , Slovakia |
| |
| Abstract: | We prove that for every prime number p and odd m>1, as s→∞, there are at least w face 2‐colorable triangular embeddings of Kw, w, w, where w = m·ps. For both orientable and nonorientable embeddings, this result implies that for infinitely many infinite families of z, there is a constant c>0 for which there are at least z nonisomorphic face 2‐colorable triangular embeddings of Kz. © 2011 Wiley Periodicals, Inc. J Graph Theory |
| |
| Keywords: | triangular embedding Latin square complete graph complete tripartite graph |
|
|
