<p>Korzhik proved that there were (2<i>s</i>)! nonisomorphic orientable quadrangular embeddings of <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40305_2025_587_Article_IEq2.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="42" /> </InlineMediaObject> <EquationSource Format="TEX">\(K_{8s+5}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>K</mi> <mrow> <mn>8</mn> <mi>s</mi> <mo>+</mo> <mn>5</mn> </mrow> </msub> </math></EquationSource> </InlineEquation>, <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40305_2025_587_Article_IEq3.gif" Format="GIF" Height="15" Rendition="HTML" Resolution="72" Type="Linedraw" Width="41" /> </InlineMediaObject> <EquationSource Format="TEX">\(s\geqslant 1\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>s</mi> <mo>⩾</mo> <mn>1</mn> </mrow> </math></EquationSource> </InlineEquation>. Hartsfield and Ringel proved that the complete graph <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40305_2025_587_Article_IEq2.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="42" /> </InlineMediaObject> <EquationSource Format="TEX">\(K_{8s+5}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>K</mi> <mrow> <mn>8</mn> <mi>s</mi> <mo>+</mo> <mn>5</mn> </mrow> </msub> </math></EquationSource> </InlineEquation> had an orientable quadrangular embedding, and the polyhedron determined by this embedding was a minimal quadrangulation of the surface. In this paper, we first construct current graphs of the complete graph <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40305_2025_587_Article_IEq5.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="78" /> </InlineMediaObject> <EquationSource Format="TEX">\(K_{8ms+4m+1}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>K</mi> <mrow> <mn>8</mn> <mi>m</mi> <mi>s</mi> <mo>+</mo> <mn>4</mn> <mi>m</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> </math></EquationSource> </InlineEquation> (<i>m</i> and <i>s</i> are natural numbers), and find <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40305_2025_587_Article_IEq6.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="74" /> </InlineMediaObject> <EquationSource Format="TEX">\([(2s)!]^{2m-1}\)</EquationSource> <EquationSource Format="MATHML"><math> <msup> <mrow> <mo stretchy="false">[</mo> <mrow> <mo stretchy="false">(</mo> <mn>2</mn> <mi>s</mi> <mo stretchy="false">)</mo> </mrow> <mo>!</mo> <mo stretchy="false">]</mo> </mrow> <mrow> <mn>2</mn> <mi>m</mi> <mo>-</mo> <mn>1</mn> </mrow> </msup> </math></EquationSource> </InlineEquation> current assignments of the current graph of <InlineEquation ID="IEq7"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40305_2025_587_Article_IEq5.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="78" /> </InlineMediaObject> <EquationSource Format="TEX">\(K_{8ms+4m+1}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>K</mi> <mrow> <mn>8</mn> <mi>m</mi> <mi>s</mi> <mo>+</mo> <mn>4</mn> <mi>m</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> </math></EquationSource> </InlineEquation>. And then, we prove that each current graph of <InlineEquation ID="IEq8"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40305_2025_587_Article_IEq5.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="78" /> </InlineMediaObject> <EquationSource Format="TEX">\(K_{8ms+4m+1}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>K</mi> <mrow> <mn>8</mn> <mi>m</mi> <mi>s</mi> <mo>+</mo> <mn>4</mn> <mi>m</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> </math></EquationSource> </InlineEquation> has at least <InlineEquation ID="IEq9"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40305_2025_587_Article_IEq9.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="165" /> </InlineMediaObject> <EquationSource Format="TEX">\([2^{2m-1}\times (2m-1)!]^{2s+1}\)</EquationSource> <EquationSource Format="MATHML"><math> <msup> <mrow> <mo stretchy="false">[</mo> <msup> <mn>2</mn> <mrow> <mn>2</mn> <mi>m</mi> <mo>-</mo> <mn>1</mn> </mrow> </msup> <mo>×</mo> <mrow> <mo stretchy="false">(</mo> <mn>2</mn> <mi>m</mi> <mo>-</mo> <mn>1</mn> <mo stretchy="false">)</mo> </mrow> <mo>!</mo> <mo stretchy="false">]</mo> </mrow> <mrow> <mn>2</mn> <mi>s</mi> <mo>+</mo> <mn>1</mn> </mrow> </msup> </math></EquationSource> </InlineEquation> orientable surface embeddings with one face. By these results, we prove that the complete graph <InlineEquation ID="IEq10"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40305_2025_587_Article_IEq5.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="78" /> </InlineMediaObject> <EquationSource Format="TEX">\(K_{8ms+4m+1}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>K</mi> <mrow> <mn>8</mn> <mi>m</mi> <mi>s</mi> <mo>+</mo> <mn>4</mn> <mi>m</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> </math></EquationSource> </InlineEquation> has at least <InlineEquation ID="IEq11"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40305_2025_587_Article_IEq11.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="276" /> </InlineMediaObject> <EquationSource Format="TEX">\([2^{2m-1}\times (2m-1)!]^{2s+1}\times [(2s)!]^{2m-1}/2\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msup> <mrow> <mo stretchy="false">[</mo> <msup> <mn>2</mn> <mrow> <mn>2</mn> <mi>m</mi> <mo>-</mo> <mn>1</mn> </mrow> </msup> <mo>×</mo> <mrow> <mo stretchy="false">(</mo> <mn>2</mn> <mi>m</mi> <mo>-</mo> <mn>1</mn> <mo stretchy="false">)</mo> </mrow> <mo>!</mo> <mo stretchy="false">]</mo> </mrow> <mrow> <mn>2</mn> <mi>s</mi> <mo>+</mo> <mn>1</mn> </mrow> </msup> <mo>×</mo> <msup> <mrow> <mo stretchy="false">[</mo> <mrow> <mo stretchy="false">(</mo> <mn>2</mn> <mi>s</mi> <mo stretchy="false">)</mo> </mrow> <mo>!</mo> <mo stretchy="false">]</mo> </mrow> <mrow> <mn>2</mn> <mi>m</mi> <mo>-</mo> <mn>1</mn> </mrow> </msup> <mo stretchy="false">/</mo> <mn>2</mn> </mrow> </math></EquationSource> </InlineEquation> nonisomorphic orientable 4<i>m</i>-gonal embeddings, and these embeddings have minimal number of faces. These results include those of of Hartsfield, Ringel and Korzhik, and these results are broader and stronger.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Superexponentially Many Nonisomorphic Orientable 4 m-gonal Embeddings of Complete Graphs

  • Zhao-Xiang Li

摘要

Korzhik proved that there were (2s)! nonisomorphic orientable quadrangular embeddings of \(K_{8s+5}\) K 8 s + 5 , \(s\geqslant 1\) s 1 . Hartsfield and Ringel proved that the complete graph \(K_{8s+5}\) K 8 s + 5 had an orientable quadrangular embedding, and the polyhedron determined by this embedding was a minimal quadrangulation of the surface. In this paper, we first construct current graphs of the complete graph \(K_{8ms+4m+1}\) K 8 m s + 4 m + 1 (m and s are natural numbers), and find \([(2s)!]^{2m-1}\) [ ( 2 s ) ! ] 2 m - 1 current assignments of the current graph of \(K_{8ms+4m+1}\) K 8 m s + 4 m + 1 . And then, we prove that each current graph of \(K_{8ms+4m+1}\) K 8 m s + 4 m + 1 has at least \([2^{2m-1}\times (2m-1)!]^{2s+1}\) [ 2 2 m - 1 × ( 2 m - 1 ) ! ] 2 s + 1 orientable surface embeddings with one face. By these results, we prove that the complete graph \(K_{8ms+4m+1}\) K 8 m s + 4 m + 1 has at least \([2^{2m-1}\times (2m-1)!]^{2s+1}\times [(2s)!]^{2m-1}/2\) [ 2 2 m - 1 × ( 2 m - 1 ) ! ] 2 s + 1 × [ ( 2 s ) ! ] 2 m - 1 / 2 nonisomorphic orientable 4m-gonal embeddings, and these embeddings have minimal number of faces. These results include those of of Hartsfield, Ringel and Korzhik, and these results are broader and stronger.