Exponentially many nonisomorphic orientable triangular embeddings of K₁₂s+3
The orientable case \(n\equiv\pmod{12}\) of the Heawood Map Color Theorem was solved by using, for each \(s\), an index three current graph with current group \(Z_{12s+3}\) (see \textit{G. Ringel} [Map Color Theorem, Springer-Verlag, Berlin (1974; Zbl 0287.05102)]), to give an orientable triangular imbedding of \(K_{12s+3}\). The present author provides a new index three current graph, with the same current group and the same result. He then shows that, for \(s\geq 11\), there are at least \(2^{2s-11}\) nonisomorphic orientable triangular imbeddings of \(K_{12s+3}\), thus completing the proof that there are constants \(M\), \(c> 0\), and \(b\geq 1/12\) such that for every \(n\geq M\) there are at least \(c2^{bn}\) nonisomorphic orientable as well as nonorientable genus imbeddings of the complete graph \(K_n\).
- Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s}\)
- A simple construction of exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s}\)
- Exponential families of non-isomorphic triangulations of complete graphs
- A new approach to constructing exponentially many nonisomorphic nonorientable triangular embeddings of complete graphs
- A lower bound for the number of orientable triangular embeddings of some complete graphs
- Exponential families of non-isomorphic non-triangular orientable genus embeddings of complete graphs.
- Exponential families of non-isomorphic triangulations of complete graphs
- Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs
- Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s}\)
- scientific article; zbMATH DE number 4006288 (Why is no real title available?)
- scientific article; zbMATH DE number 3450230 (Why is no real title available?)
- On the number of nonisomorphic orientable regular embeddings of complete graphs
- Recursive constructions for triangulations
- Exponentially many maximum genus embeddings and genus embeddings for complete graphs
- Embeddings of an \(M_{12}\) geometry: Some simple combinatorial descriptions
- Another proof of the map color theorem for nonorientable surfaces.
- A simple construction for orientable triangular embeddings of the complete graphs on 12 s vertices
- On the number of nonisomorphic orientable regular embeddings of complete graphs
- A nonorientable triangular embedding of \(K_ n-K_ 2\), \(n\equiv 8\pmod{12}\)
- Exponentially many genus embeddings of the complete graph \(K_{12s+3}\)
- Triangular embeddings of complete graphs from graceful labellings of paths
- Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s}\)
- A new approach to constructing exponentially many nonisomorphic nonorientable triangular embeddings of complete graphs
- Recursive constructions and nonisomorphic minimal nonorientable embeddings of complete graphs
- A simple proof of the map color theorem for nonorientable surfaces
- Generating nonisomorphic quadrangular embeddings of a complete graph
- On the number of triangular embeddings of complete graphs and complete tripartite graphs
- The number of triangular embeddings for complete graph \({K_{19}}\) on orientable surface
- Dihedral biembeddings and triangulations by complete and complete tripartite graphs
- Complete triangulations of a given order generated from a multitude of nonisomorphic cubic graphs by current assignments
- Doubly even orientable closed 2-cell embeddings of the complete graph
- A simple construction of exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s}\)
- Even embeddings of the complete graphs and their cycle parities
- Triangular embeddings of complete graphs (neighborly maps) with 12 and 13 vertices
- Nonisomorphic complete triangulations of a surface
- Index 3 biembeddings of the complete graphs
- The number of nonisomorphic nonorientable 6-gonal embeddings of complete graphs
- Exponentially many nonisomorphic genus embeddings of \(K_{n,m}\)
- Auxiliary embeddings and constructing triangular embeddings of joins of complete graphs with edgeless graphs
- A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs
- Genus embeddings of a type of graph
This page was built for publication: Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s+3}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1011722)
