𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Triangular embeddings of K((i-2) n, n,…,n)

✍ Scribed by Brad Jackson


Publisher
John Wiley and Sons
Year
1980
Tongue
English
Weight
405 KB
Volume
4
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis


Abstract

For complete i‐partite graphs of the form K(n~1~, n, n, …, n) the largest value of n~1~ that allows the graph to be triangularly‐embedded into a surface is (i‐2)n. In this paper the author constructs triangular embeddings into surfaces of some complete partite graphs of the form K((i‐2)n, n, …, n). The embeddings are exhibited using embedding schemes but the surfaces into which K((i‐2)n, n, …, n) are triangularly embedded can be seen to be particularly nice branched covers of a surface into which K(i‐2, 1, 1,…,1) is triangularly embedded.


📜 SIMILAR VOLUMES


New regular embeddings of n-cubes Qn
✍ Young Soo Kwon 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 147 KB

## Abstract We investigate highly symmetrical embeddings of the __n__‐dimensional cube __Q__~__n__~ into orientable compact surfaces which we call regular embeddings of __Q__~__n__~. We derive some general results and construct some new families of regular embeddings of __Q__~__n__~. In particular,

On Integers of the Forms k−2n and k2n+1
✍ Yong-Gao Chen 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 85 KB

In this paper we prove that the set of positive odd integers k such that k&2 n has at least three distinct prime factors for all positive integers n contains an infinite arithmetic progression. The same result corresponding to k2 n +1 is also true.

Cayleyan n-encoded SU(2)×n↓ embeddings:
✍ F. P. Temme 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 506 KB

The complete nuclear permutational (CNP) statistics of SU(2) × S n spin ensembles of forms [A] n /[AX] n for cage molecules [i.e., exclusive (not mixed-isotope) isotopomers] are shown to yleld totally analytic invariance sets on the basis of vertex-point spins (or more generally Schur function label

The crossing number of K1,3,n and K2,3,n
✍ Kouhei Asano 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 234 KB

In this article, we will determine the crossing number of the complete tripartite graphs K,.3.n and K2,3.n. Our proof depends on Kleitman's results for the complete bipartite graphs [D. J. Kleitman, The crossing number of K5,n. J. Combhatorial Theory 9 (1970) 375-3231. a graph G is the minimum numbe

One-Pot Syntheses of 2-N-Alkylamino-, 2-
✍ Ol'ga A. Tarasova; Ludmila V. Klyba; Vladimir Yu. Vvedensky; Nina A. Nedolya; Bo 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 353 KB 👁 2 views

A number of 2-N-alkylamino-or 2-N-phenylamino-, 2-N,N-RCH 2 CϵCLi, or the lithiated allene, tBuCH=C=CHLi, and isothiocyanate, RЈN=C=S, in tetrahydrofuran and subse-dialkylamino-, and 2-N-alkyl-N-phenylaminothiophenes have been prepared in good yields by adding a solution of quently hydrolyzing the r