Exponentially many genus embeddings of the complete graph K₁₂s+3
From MaRDI portal
Publication:2355353
The (orientable) maximum genus of a graph \(G\) is the maximum genus of an orientable surface for which a 2-cell embedding of the graph \(G\) exists. This paper provides a lower bound for the number of orientable maximum genus embeddings for a particular type of complete graphs. Theorem: For \(s\) sufficiently large, the complete graph \(K_{12s + 3}\) has at least \(\frac{1}{2}\times \left ( \frac{200}{9}\right ) ^s\) distinct genus embeddings in surfaces.
Recommendations
- Exponentially many maximum genus embeddings and genus embeddings for complete graphs
- Minimum genus embeddings of the complete graph
- Lower bound of the number of maximum genus embeddings and genus embeddings of \(K_{12s+7}\)
- Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s+3}\)
- Publication:4887820
Cites work
- A note on the number of graceful labellings of paths
- 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
- Face 2-colourable triangular embeddings of complete graphs
- Graphs on surfaces
- How to determine the maximum genus of a graph
- scientific article; zbMATH DE number 4024313 (Why is no real title available?)
- scientific article; zbMATH DE number 3754724 (Why is no real title available?)
- scientific article; zbMATH DE number 951476 (Why is no real title available?)
- scientific article; zbMATH DE number 3450230 (Why is no real title available?)
- On the number of maximum genus embeddings of almost all graphs
- On the number of nonisomorphic orientable regular embeddings of complete graphs
- The maximum genus of graphs of diameter two
- Three nonisomorphic triangulations of an orientable surface with the same complete graph
- Triangular embeddings of complete graphs from graceful labellings of paths
Cited in
(13)- Exponentially many maximum genus embeddings and genus embeddings for complete graphs
- Embeddings of an \(M_{12}\) geometry: Some simple combinatorial descriptions
- On the asymptotic growth of bipartite graceful permutations
- Exponential families of non-isomorphic non-triangular orientable genus embeddings of complete graphs.
- The genus of complete 3-uniform hypergraphs
- Triangular embeddings of complete graphs from graceful labellings of paths
- Minimum genus embeddings of the complete graph
- scientific article; zbMATH DE number 913548 (Why is no real title available?)
- Simultaneous current graph constructions for minimum triangulations and complete graph embeddings
- Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs
- Embeddings of circular ladder-like graph families
- Jungerman ladders and index 2 constructions for genus embeddings of dense regular graphs
- Lower bound of the number of maximum genus embeddings and genus embeddings of \(K_{12s+7}\)
This page was built for publication: Exponentially many genus embeddings of the complete graph \(K_{12s+3}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2355353)
