SearcharxivSearch

arXiv · 1804.06692

Platonic solids, Archimedean solids and semi-equivelar maps on the sphere

Abstract

A vertex-transitive map $X$ is a map on a surface on which the automorphism group of $X$ acts transitively on the set of vertices of $X$. If the face-cycles at all the vertices in a map are of same type then the map is called a semi-equivelar map. Clearly, a vertex-transitive map is semi-equivelar. Converse of this is not true in general. In particular, there are semi-equivelar maps on the torus, on the Klein bottle and on the surfaces of Euler characteristics $-1$ $\&$ $-2$ which are not vertex-transitive. It is known that the boundaries of Platonic solids, Archimedean solids, regular prisms and antiprisms are vertex-transitive maps on $\mathbb{S}^2$. Here we show that there is exactly one semi-equivelar map on $\mathbb{S}^2$ which is not vertex-transitive. More precisely, we show that a semi-equivelar map on $\mathbb{S}^2$ is the boundary of a Platonic solid, an Archimedean solid, a regular prism, an antiprism or the pseudorhombicuboctahedron. As a consequence, we show that all the semi-equivelar maps on $\mathbb{RP}^2$ are vertex-transitive. Moreover, every semi-equivelar map on $\mathbb{S}^2$ can be geometrized, i.e., every semi-equivelar map on $\mathbb{S}^2$ is isomorphic to a semi-regular tiling of $\mathbb{S}^2$. In the course of the proof of our main result, we present a combinatorial characterization in terms of an inequality of all the types of semi-equivelar maps on $\mathbb{S}^2$. Here, we present self-contained combinatorial proofs of all our results.

Explore related subjects

Keep this discovery

BibTeXRIS

Basudeb Datta, Dipendu Maity. 2018-04-18. Platonic solids, Archimedean solids and semi-equivelar maps on the sphere. https://arxiv.org/abs/1804.06692

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Balanced even cycles in signed graphs:Tur\'an bounds, double covers, and parity obstructions

We study Tur\'an problems for balanced even cycles in simple signed graphs, where signed subgraphs are considered up to switching. For every balanced bipartite signed graph, the signed and ordinary Tur\'an numbers differ by at most a factor of two. Our main structural results concern the underlying graphs that admit a signing in which every $2k$-cycle is unbalanced. We characterize these graphs by the absence of an odd dependence among their $2k$-cycle incidence vectors, give a cohomological formulation, and construct subgraph-minimal obstructions of arbitrarily large order. In particular, there is no finite forbidden-subgraph characterization. We also give an exact closed-walk criterion for cycles in double covers and derive a direct signed breadth-first-search upper bound. As applications, we prove \[ \hex(n,C_{+4})=\left(\frac{\sqrt2}{2}+o(1)\right)n^{3/2} \] and study the signed hexagon number $R_6(n)=\hex(n,\{C_{-3},C_{+6}\})$. We characterize the underlying graphs counted by $R_6$ and express it as an extremal problem for ordinary $C_6$-free graphs with a prescribed involution. For every sufficiently large $n$, we construct examples with $\Omega(n^{4/3})$ edges, and we give an equivariant construction attaining the coefficient obtained from the F\"uredi--Naor--Verstra\"ete lower bound by double-cover transfer. Finally, we give $n$-vertex $C_{+10}$-free signed graphs with $\Omega(n^{6/5})$ edges and use octagon examples to illustrate the limitations of theta-freeness as a signing criterion.

math.CO

Fractional DP-colorings of $d$-degenerate locally sparse graphs

Bernshteyn, Kostochka, and Zhu (2020) introduced the notion of fractional DP-coloring, which generalizes both fractional coloring and fractional list coloring. Among several foundational results, they proved that every $d$-degenerate bipartite graph $G$ satisfies $\chi_f^{\mathrm{DP}} \le (1 + o(1))\frac{d}{\log d}$, and that this bound is optimal---a stark contrast to ordinary fractional coloring. In this paper, we extend this upper bound to all $d$-degenerate triangle-free graphs, proving that $\chi_f^{\mathrm{DP}} \le (4 + o(1))\frac{d}{\log d}$. This generalizes a recent result of Martinsson and Steiner (2025) for ordinary fractional coloring. We derive this result as a corollary of a more general upper bound concerning locally sparse graph orderings. Specifically, a $d$-degenerate graph $G$ is left $k$-locally-sparse if it admits a degeneracy ordering in which, for every vertex $v$, the subgraph induced by its back-neighbors contains at most $k$ edges. We show that if a $d$-degenerate graph $G$ is left $\frac{d^2}{f}$-locally-sparse, then \[ \chi_f^{\mathrm{DP}}(G) \le (8 + o(1))\frac{d}{\log f}. \] This immediately yields an identical upper bound on the ordinary fractional chromatic number $\chi_f(G)$, improving upon the leading constants of previously known bounds. Additionally, we establish the asymptotic sharpness of this result up to the leading constant. For any $1 \ll f \le d^2$, we construct $d$-degenerate graphs that are left $\frac{d^2}{f}$-locally-sparse and satisfy $\chi_f(G) \ge (1 - o(1))\frac{d}{\log f}$. Finally, as applications of our main theorem, we obtain improved upper bounds on the fractional DP-chromatic number of $d$-degenerate $K_{1,t,t}$-free graphs, as well as $K_{t,t,t}$-free graphs with maximum degree $\Delta$. Notably, these bounds improve upon existing results even in the setting of ordinary fractional coloring.

math.CO

Erd\H{o}s-S\'{o}s for digraphs

It is shown that every Eulerian digraph on $n$ vertices with more than $(t-1)n$ arcs contains every oriented tree with $t$ edges. The digraphs have no loops or repeated arcs, but opposite arcs are permitted. The bound is sharp for each fixed oriented tree, as witnessed by disjoint unions of complete bidirected graphs. Previously, such tight bounds were not known, even just for directed paths. This can be considered as a directed analog of the recently proved Erd\H{o}s-S\'os conjecture. The result was proved by GPT-6 Astra.

math.CO