Related papers: Vertex-Minimal Paper Tori

A peculiarity of the geometry of the euclidean 3-sphere $\S3$ is that it allows for the existence of compact without boundary minimally immersed surfaces. Despite a wealthy of examples of such surfaces, the only known tori minimally…

Inspired by the work in \cite{sauer} regarding the classification of all the zero-divisor graphs with six vertices, we obtain all the zero-divisor graphs with seven vertices. Hence we classify all the zero-divisor commutative semigroups…

In this paper and a companion paper, we prove that, if $m$ is sufficiently large, every graph on $m+1$ vertices that has a universal vertex and minimum degree at least $\lfloor \frac{2m}{3} \rfloor$ contains each tree $T$ with $m$ edges as…

Semi-Equivelar maps are generalizations of maps on the surfaces of Archimedean solids to surfaces other than the $2$-sphere. The well known 11 types of normal tilings of the plane suggest the possible types of semi-equivelar maps on the…

Let k>0 be an integer, let H be a minor-minimal graph in the projective plane such that every homotopically non-trivial closed curve intersects H at least k times, and let G be the planar double cover of H obtained by lifting G into the…

We present the first algorithm to morph graphs on the torus. Given two isotopic essentially 3-connected embeddings of the same graph on the Euclidean flat torus, where the edges in both drawings are geodesics, our algorithm computes a…

A torus manifold $M$ is a $2n$-dimensional orientable manifold with an effective action of an $n$-dimensional torus such that $M^T\neq \emptyset$. In this paper we discuss the classification of torus manifolds which admit an invariant…

Connected Vertex Cover is one of the classical problems of computer science, already mentioned in the monograph of Garey and Johnson. Although the optimization and decision variants of finding connected vertex covers of minimum size or…

Beineke, Harary and Ringel discovered a formula for the minimum genus of a torus in which the $n$-dimensional hypercube graph can be embedded. We give a new proof of the formula by building this surface as a union of certain faces in the…

We study the abstract regular polyhedra with automorphism groups that act faithfully on their vertices, and show that each non-flat abstract regular polyhedron covers a "vertex-faithful" polyhedron with the same number of vertices. We then…

The $n$-torus is the the unique closed manifold supporting a set of $n$ linearly independent closed $1$-forms. In this paper we improve on this result and show that the torus is the unique closed $n$-dimensional manifold supporting a…

A rectangular dual of a plane graph $G$ is a contact representation of $G$ by interior-disjoint rectangles such that (i) no four rectangles share a point, and (ii) the union of all rectangles is a rectangle. In this paper, we study…

The dual of a polyhedron is a polyhedron -- or in graph theoretical terms: the dual of a 3-connected plane graph is a 3-connected plane graph. Astonishingly, except for sufficiently large facewidth, not much is known about the connectivity…

Generalizing earlier work by Ros in ambient dimension three, we prove an affine lower bound for the Morse index of closed minimal hypersurfaces inside a flat torus in terms of their first Betti number (with purely dimensional coefficients).

Let $\mathrm{rex}(n, F)$ denote the maximum number of edges in an $n$-vertex graph that is regular and does not contain $F$ as a subgraph. We give lower bounds on $\mathrm{rex}(n, F)$, that are best possible up to a constant factor, when…

We prove that, if $m$ is sufficiently large, every graph on $m+1$ vertices that has a universal vertex and minimum degree at least $\lfloor \frac{2m}{3} \rfloor$ contains each tree $T$ with $m$ edges as a subgraph. Our result confirms, for…

In this paper, we discuss optimal $1$-toroidal graphs (abbreviated as O1TG), which are drawn on the torus so that every edge crosses another edge at most once, and has $n$ vertices and exactly $4n$ edges. We first consider connectivity of…

The fundamental group of $M = \sharp_n (S^2\times S^1)$ is $F_n$, the free group with $n$ generators. There is a 1-1 correspondence between the equivalence classes of $\mathbb{Z}$-- splittings of $F_n$ and homotopy classes of embedded…

A graph is 1-planar if it can be drawn in the plane so that each edge is crossed by at most one another edge. In this work we prove that each 1-planar graph of minimum degree at least $3$ contains an edge with degrees of its endvertices of…

A triangulation of a punctured or pinched surface is irreducible if no edge can be shrunk without producing multiple edges or changing the topological type of the surface. The finiteness of the set of (non-isomorphic) irreducible…