The genus of the n-octahedron: Regular cases
The genus of the n-octahedron: Regular cases
复制标题
n 八面体的属：常规情况
作者：
M. Jungerman;G. Ringel
n-八面体On，也记为K（2，2，...，2）或Kn（2），是在每个部集中有两个顶点的完全n部图。式
对所有n，给出了On的（可定向）亏格，并证明了对n ≠（mof 3），当n = 2（mod 3）时，三角嵌入是可能的，并且通过展示这种嵌入来建立公式。
The n-octahedron On, also denoted K(2,2, …, 2) or Kn(2), is the complete n-partite graph with two vertices in each partite set. The formula
for the (orientable) genus of On is conjectured for all n and proved for n ≠ (mof 3). Triangular embeddigns are possible precisely when n ≠ 2 (mod 3), and the formula is established by exhibiting such embeddings.