Related papers: Visibility Representations of Toroidal and Klein-b…
The dimer model on a graph embedded in the torus can be interpreted as a collection of random self-avoiding loops. In this paper, we consider the uniform toroidal honeycomb dimer model. We prove that when the mesh of the graph tends to zero…
We list special graphs of degree 4 with at most 3 vertices (atoms from the theory of integrable hamiltonian systems) which could be represented by a union of closed geodesics on the one of the following surfaces with metric of constant…
In this paper, we analyze embeddings of grid graphs on orientable surfaces. We determine the genus of a large class of k-dimensional grid graphs and effective two-sided bounds for the genus of any 3-dimensional grid graph, both in terms of…
Let $A$ be a finite-dimensional gentle algebra over an algebraically closed field. We investigate the combinatorial properties of support $\tau$-tilting graph of $A$. In particular, it is proved that the support $\tau$-tilting graph of $A$…
Consider a finite connected graph possibly with multiple edges and loops. In discrete geometric analysis, Kotani and Sunada constructed the crystal associated to the graph as a standard realization of the maximal abelian covering of the…
Pointed pseudo-triangulations are planar minimally rigid graphs embedded in the plane with pointed vertices (adjacent to an angle larger than 180 degrees. In this paper we prove that the opposite statement is also true, namely that planar…
We examine semi-bar visibility graphs in the plane and on a cylinder in which sightlines can pass through k objects. We show every semi-bar k-visibility graph has a (k+2)-quasiplanar representation in the plane with vertices drawn as points…
A rectangle visibility graph (RVG) is represented by assigning to each vertex a rectangle in the plane with horizontal and vertical sides in such a way that edges in the graph correspond to unobstructed horizontal and vertical lines of…
A 1930s conjecture of Hopf states that an even-dimensional compact Riemannian manifold with positive sectional curvature has positive Euler characteristic. We prove this conjecture under the additional assumption that the isometry group has…
We study holomorphic GL(2) and SL(2) geometries on compact complex manifolds. We show that a compact K\"ahler manifold of complex even dimension higher than two admitting a holomorphic GL(2)-geometry is covered by a compact complex torus.…
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…
We prove a flat torus theorem for quadric complexes. In particular, we show that if a non-cyclic free abelian group $G$ acts metrically properly on a quadric complex $X$, then $G \cong \mathbb{Z}^2$ and $X$ contains a $G$-invariant…
This work is about graphs arising from Reuleaux polyhedra. Such graphs must necessarily be planar, $3$-connected and strongly self-dual. We study the question of when these conditions are sufficient. If $G$ is any such a graph with…
The work provides a brief intuitive overview theory of graph on surfaces. We considers graphs with an additional structure, wich we call discs with ribbons, also known as one-vertex ribbon graphs. And solves the problem (Skopenkov's) about…
We determine which bipartite graphs embedded in a torus are move-reduced. In addition, we classify equivalence classes of such move-reduced graphs under square/spider moves. This extends the class of minimal graphs on a torus studied by…
We prove that every cyclically 4-edge-connected cubic graph that can be embedded in the torus, with the exceptional graph class called "Petersen-like", is 3-edge-colorable. This means every (non-trivial) toroidal snark can be obtained from…
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…
We consider the regularized trace of the inverse of the Laplacian on a skinny torus. With its flat metric, a skinny torus has large trace, but we show that there are conformally equivalent metrics making the trace close to that of a sphere…
The use of Cauchy's method to prove Euler's well-known formula is an object of many controversies. The purpose of this paper is to prove that Cauchy's method applies for convex polyhedra and not only for them, but also for surfaces such as…
We show that all nontrivial embeddings of planar graphs on the torus contain a nontrivial knot or a nonsplit link. This is equivalent to showing that no minimally knotted planar spatial graphs on the torus exist that contain neither a…