✦ LIBER ✦

On the number of triangular embeddings of complete graphs and complete tripartite graphs

✍ Scribed by M. J. Grannell; M. Knor

Publisher: John Wiley and Sons
Year: 2011
Tongue: English
Weight: 159 KB
Volume: 69
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.20590

No coin nor oath required. For personal study only.

✦ Synopsis

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 K~w, w, w~, where w = m·p^s^. 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 K~z~. © 2011 Wiley Periodicals, Inc. J Graph Theory

📜 SIMILAR VOLUMES

Face 2-Colourable Triangular Embeddings

Face 2-Colourable Triangular Embeddings of Complete Graphs

✍ M.J. Grannell; T.S. Griggs; Jozef Širáň 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 420 KB

A face 2-colourable triangulation of an orientable surface by a complete graph K n exists if and only if n#3 or 7 (mod 12). The existence of such triangulations follows from current graph constructions used in the proof of the Heawood conjecture. In this paper we give an alternative construction for

On the Number of Nonisomorphic Orientabl

On the Number of Nonisomorphic Orientable Regular Embeddings of Complete Graphs

✍ Vladimir P. Korzhik; Heinz-Jurgen Voss 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 260 KB

In this paper we consider those 2-cell orientable embeddings of a complete graph K n+1 which are generated by rotation schemes on an abelian group 8 of order n+1, where a rotation scheme an 8 is defined as a cyclic permutation ( ; 1 , ; 2 , ..., ; n ) of all nonzero elements of 8. It is shown that t

Triangular embeddings of complete graphs

Triangular embeddings of complete graphs (neighborly maps) with 12 and 13 vertices

✍ M. N. Ellingham; Chris Stephens 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 133 KB

In this paper, we describe the generation of all nonorientable triangular embeddings of the complete graphs K 12 and K 13 . (The 59 nonisomorphic orientable triangular embeddings of K 12 were found in 1996 by Altshuler, Bokowski, and Schuchert, and K 13 has no orientable triangular embeddings.) Ther

Regular orientable embeddings of complet

Regular orientable embeddings of complete bipartite graphs

✍ Jin Ho Kwak; Young Soo Kwon 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 199 KB

## Abstract In this paper, it will be shown that the isomorphism classes of regular orientable embeddings of the complete bipartite graph __K__~__n,n__~ are in one‐to‐one correspondence with the permutations on __n__ elements satisfying a given criterion, and the isomorphism classes of them are com

Exponential Families of Non-isomorphic N

Exponential Families of Non-isomorphic Non-triangular Orientable Genus Embeddings of Complete Graphs

✍ Vladimir P. Korzhik; Heinz-Jurgen Voss 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 421 KB

It is shown that for every i 2 f1; 2; . . . ; 11g=f3; 4; 7g the complete graph K 12sþi for s5dðiÞ 2 f1; 2; 3; 4g has at least hðiÞ4 s non-isomorphic orientable genus embeddings, where hðiÞ 2 1; 1 2 ; 1 4 ; 1 8

The ramsey numbers for stripes and one c

The ramsey numbers for stripes and one complete graph

✍ Peter Lorimer 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 244 KB 👁 1 views

The Ramsey numbers M,,, n,P,, ..., n,P,), p > 2, are calculated. ## 1. Introduction One class of generalized Ramsey numbers that are known exactly are those for the graphs nP2 which consist of n disjoint paths of length 2; E. J. Cockayne and the author proved in 111 that d r(nlp2, ..., n d P 2 ) =