Related papers: Shortest path embeddings of graphs on surfaces

A graph is called $\alpha_i$-metric ($i \in {\cal N}$) if it satisfies the following $\alpha_i$-metric property for every vertices $u, w, v$ and $x$: if a shortest path between $u$ and $w$ and a shortest path between $x$ and $v$ share a…

We investigate the following problem: Given two embeddings G_1 and G_2 of the same abstract graph G on an orientable surface S, decide whether G_1 and G_2 are isotopic; in other words, whether there exists a continuous family of embeddings…

Recent research has shown that alignment between the structure of graph data and the geometry of an embedding space is crucial for learning high-quality representations of the data. The uniform geometry of Euclidean and hyperbolic spaces…

For a Riemannian manifold $(N,g)$, we construct a scalar flat metric $G$ in the tangent bundle $TN$. It is locally conformally flat if and only if either, $N$ is a 2-dimensional manifold or, $(N,g)$ is a real space form. It is also shown…

The Metric Embedding problem takes as input two metric spaces $(X,D_X)$ and $(Y,D_Y)$, and a positive integer $d$. The objective is to determine whether there is an embedding $F:X \rightarrow Y$ such that $d_{F} \leq d$, where $d_{F}$…

Menger's Theorem is a fundamental result in graph theory. It states that if in a graph $G$ with distinguished sets of terminal vertices $S$ and $T$ there are no $k$ pairwise vertex-disjoint $S$-$T$ paths, then there is a set of less than…

We prove that there is an algorithm which determines whether or not a given 2-polyhedron can be embedded into some integral homology 3-sphere. This is a corollary of the following main result. Let $M$ be a compact connected orientable…

Let $G$ be a connected graph and $u,v$ and $w$ vertices of $G$. Then $w$ is said to {\em strongly resolve} $u$ and $v$, if there is either a shortest $u$-$w$ path that contains $v$ or a shortest $v$-$w$ path that contains $u$. A set $W$ of…

We derive new, sharp lower bounds for certain curvature functionals on the space of Riemannian metrics of a smooth compact 4-manifold with a non-trivial Seiberg-Witten invariant. These allow one, for example, to exactly compute the infimum…

Let $S$ be a set of $n$ points in a polygon $P$ with $m$ vertices. The geodesic unit-disk graph $G(S)$ induced by $S$ has vertex set $S$ and contains an edge between two vertices whenever their geodesic distance in $P$ is at most one. In…

A graph is nearly embedded in a surface if it consists of graph $G_0$ that is embedded in the surface, together with a bounded number of vortices having no large transactions. It is shown that every large wall (or grid minor) in a nearly…

We present an efficient algorithm for a problem in the interface between clustering and graph embeddings. An embedding $\varphi:G\rightarrow M$ of a graph $G$ into a 2-manifold $M$ maps the vertices in $V(G)$ to distinct points and the…

Real-world graphs have inherently complex and diverse topological patterns, known as topological heterogeneity. Most existing works learn graph representation in a single constant curvature space that is insufficient to match the complex…

Recent studies have experimentally shown that we can achieve in non-Euclidean metric space effective and efficient graph embedding, which aims to obtain the vertices' representations reflecting the graph's structure in the metric space.…

Learning faithful graph representations as sets of vertex embeddings has become a fundamental intermediary step in a wide range of machine learning applications. The quality of the embeddings is usually determined by how well the geometry…

We investigate the extremal properties of saturated partial plane embeddings of maximal planar graphs. For a planar graph $G$, the plane-saturation number $\mathrm{sat}_{\mathcal{P}}(G)$ denotes the minimum number of edges in a plane…

A basic feature of Teichm\"uller theory of Riemann surfaces is the interplay of two dimensional hyperbolic geometry, the behavior of geodesic-length functions and Weil-Petersson geometry. Let $\mathcal{T}_g$ $(g\geq 2)$ be the Teichm\"uller…

We revisit the issue of low-distortion embedding of metric spaces into the line, and more generally, into the shortest path metric of trees, from the parameterized complexity perspective.Let $M=M(G)$ be the shortest path metric of an edge…

In this paper, we consider a closed Riemannian manifold $M^{n+1}$ with dimension $3\leq n+1\leq 7$, and a compact Lie group $G$ acting as isometries on $M$ with cohomogeneity at least $3$. After adapting the Almgren-Pitts min-max theory to…

Graphs that are critical (minimal excluded minors) for embeddability in surfaces are studied. In Part I we consider the structure of graphs with a 2-vertex-cut that are critical with respect to the Euler genus. A general theorem describing…