Doubly even orientable closed 2-cell embeddings of the complete graph

MaRDI QIDQ405100zbMATH OpenFDO

Authors Michael John Grannell, Thomas A. McCourt

Publication date 4 September 2014

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i1p22

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

orientable closed 2-cell embeddings

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph designs and isomorphic decomposition (05C51) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Review text

Summary: For all \(m\geq 1\) and \(k\geq 2\), we construct closed 2-cell embeddings of the complete graph \(K_{8km+4k+1}\) with faces of size \(4k\) in orientable surfaces. Moreover, we show that when \(k\geq 3\) there are at least \((2m-1)!/2(2m+1)=2^{2m\log_2m-O(m)}\) nonisomorphic embeddings of this type. We also show that when \(k=2\) there are at least \(\frac14 \pi^{\frac12}m^{-\frac{5}{4}}\left(\frac{4m}{e^2}\right)^{\sqrt{m}}(1-o(1))\) nonisomorphic embeddings of this type.

Recommendations

• Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s+3}\)
• On the number of nonisomorphic orientable regular embeddings of complete graphs
• A lower bound for the number of orientable triangular embeddings of some complete graphs
• Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs
• Recursive constructions and nonisomorphic minimal nonorientable embeddings of complete graphs

Cites work

• A lower bound for the number of orientable triangular embeddings of some complete graphs
• A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs
• Biembeddings of symmetric \(n\)-cycle systems
• Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles
• Exponential families of non-isomorphic triangulations of complete graphs
• Generating nonisomorphic quadrangular embeddings of a complete graph
• Hamiltonian embeddings from triangulations
• scientific article; zbMATH DE number 4006288 (Why is no real title available?)
• scientific article; zbMATH DE number 3450230 (Why is no real title available?)
• scientific article; zbMATH DE number 3332246 (Why is no real title available?)
• On the number of nonisomorphic orientable regular embeddings of complete graphs
• The nonorientable genus of joins of complete graphs with large edgeless graphs
• The orientable genus of some joins of complete graphs with large edgeless graphs
• The topological theory of current graphs

Cited in

(10)

• A common cover of graphs and 2-cell embeddings
• Globally simple heffter arrays \(H ( n ; k )\) when \(k \equiv 0 , 3 \pmod 4 \)
• Quadrangular embeddings of complete graphs and the even map color theorem
• Congruence classes of orientable 2-cell embeddings of bouquets of circles and dipoles
• scientific article; zbMATH DE number 475602 (Why is no real title available?)
• Even embeddings of the complete graphs and their cycle parities
• Mutually orthogonal cycle systems
• Face distributions of embeddings of complete graphs
• Embedding K3,3 and K5 on the Double Torus
• The number of nonisomorphic nonorientable 6-gonal embeddings of complete graphs

This page was built for publication: Doubly even orientable closed 2-cell embeddings of the complete graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q405100)