Related papers: Visibility Representations of Toroidal and Klein-b…
We give a discrete Bonnet Myers type theorem for the effective diameter assuming positive Ollivier curvature. We prove that this diameter bound is attained if and only if the graph is a cocktail party graph, a Johnson graph, a halved cube,…
Let $M$ be a topological space that admits a free involution $\tau$, and let $N$ be a topological space. A homotopy class $\beta \in [ M,N ]$ is said to have the Borsuk-Ulam property with respect to $\tau$ if for every representative map…
A Triangulated Irregular Network (TIN) is a data structure that is usually used for representing and storing monotone geographic surfaces, approximately. In this representation, the surface is approximated by a set of triangular faces whose…
We consider a graph representation in the plane, called the transparent rectangle visibility graph (TRVG), where each vertex is represented by a rectangle in the plane with sides parallel to the plane axes, in a way that any two vertices…
We describe procedures for generating all 2-cell embedded simple graphs with up to a fixed number of vertices on a given surface. We also modify these procedures to generate closed 2-cell embeddings and polyhedral embeddings. We give…
The fundamental group of every surface that is not the projective plane or Klein bottle has a representation to a torsion-free group of upper-triangular matrices in SL(2,R) with no simple loop (i.e. a nontrivial element representing a…
If a graph can be drawn on the torus so that every two independent edges cross an even number of times, then the graph can be embedded on the torus.
By works of Schoen-Yau and Gromov-Lawson any Riemannian manifold with nonnegative scalar curvature and diffeomorphic to a torus is isometric to a flat torus. Gromov conjectured subconvergence of tori with respect to a weak Sobolev type…
A rectangle visibility representation (RVR) of a graph consists of an assignment of axis-aligned rectangles to vertices such that for every edge there exists a horizontal or vertical line of sight between the rectangles assigned to its…
This paper provides a linear time algorithm in the number of edges that, given a simple 3-connected non-planar graph G with a Klein bottle rotation system, outputs a straight line drawing of G with no crossings on the flat Klein bottle.
Given a generic totally real torus unknotted in the unit sphere of the complex plane, we prove the following alternative : either there exists a filling of the torus by holomorphic discs and the torus is rationally convex, or its rational…
We study two variants of the problem of contact representation of planar graphs with axis-aligned boxes. In a cube-contact representation we realize each vertex with a cube, while in a proportional box-contact representation each vertex is…
In this paper, we show how to construct graph theoretical models of n-dimensional continuous objects and manifolds. These models retain topological properties of their continuous counterparts. An LCL collection of n-cells in Euclidean space…
Recently, Cohen and Vandembroucq proved that the reduced topological complexity of the Klein bottle is 4. Simultaneously and independently, we announced a proof of the same result. Mistakes were found in our argument, which was quite…
We consider three classes of geodesic embeddings of graphs on Euclidean flat tori: (1) A toroidal graph embedding $\Gamma$ is positive equilibrium if it is possible to place positive weights on the edges, such that the weighted edge vectors…
Semialgebraic graphs are graphs whose vertices are points in $\mathbb{R}^d$, and adjacency between two vertices is determined by the truth value of a semialgebraic predicate of constant complexity. We show how to harness polynomial…
A triangulation of a connected closed surface is called weakly regular if the action of its automorphism group on its vertices is transitive. A triangulation of a connected closed surface is called degree-regular if each of its vertices…
It is shown that each quadrangulation of the 2-torus by the Cartesian product of two cycles can be geometrically realized in (Euclidean) 4-space without hidden symmetries---that is, so that each combinatorial cellular automorphism of the…
In this paper, we provide a characterization of uniquely representable two-directional orthogonal ray graphs, which are defined as the intersection graphs of rightward and downward rays. The collection of these rays is called a…
We describe the structure of 2-connected non-planar toroidal graphs with no K_{3,3}-subdivisions, using an appropriate substitution of planar networks into the edges of certain graphs called toroidal cores. The structural result is based on…