Exponential families of non-isomorphic triangulations of complete graphs
CP Bonnington, MJ Grannell, TS Griggs… - Journal of Combinatorial …, 2000 - Elsevier
CP Bonnington, MJ Grannell, TS Griggs, J Širáň
Journal of Combinatorial Theory, Series B, 2000•ElsevierExponential Families of Non-Isomorphic Triangulations of Complete Graphs Page 1 Journal
of Combinatorial Theory, Series B 78, 169 184 (2000) Exponential Families of Non-Isomorphic
Triangulations of Complete Graphs C. Paul Bonnington Department of Mathematics,
University of Auckland, Private Bag 92019, Auckland, New Zealand MJ Grannell and TS
Griggs Department of Pure Mathematics, The Open University, Walton Hall, Milton Keynes
MK7 6AA, United Kingdom and J. S8iran Department of Mathematics, SvF, Slovak Technical …
of Combinatorial Theory, Series B 78, 169 184 (2000) Exponential Families of Non-Isomorphic
Triangulations of Complete Graphs C. Paul Bonnington Department of Mathematics,
University of Auckland, Private Bag 92019, Auckland, New Zealand MJ Grannell and TS
Griggs Department of Pure Mathematics, The Open University, Walton Hall, Milton Keynes
MK7 6AA, United Kingdom and J. S8iran Department of Mathematics, SvF, Slovak Technical …
We prove that the number of non-isomorphic face 2-colourable triangulations of the complete graph Kn in an orientable surface is at least 2n2/54−O(n) for n congruent to 7 or 19 modulo 36, and is at least 22n2/81−O(n) for n congruent to 19 or 55 modulo 108.
Elsevier
