Related papers: Embedding products of graphs into Euclidean spaces

We define the total curvature of a semialgebraic embedding of a graph in the 3-dimensional Euclidean space. We prove that it satisfies a Chern-Lashof type inequality and we describe when the equality holds. We also prove a generalization of…

Let $G=(V,E)$ be a finite, connected graph. We consider a greedy selection of vertices: given a list of vertices $x_1, \dots, x_k$, take $x_{k+1}$ to be any vertex maximizing the sum of distances to the existing vertices and iterate: we…

We offer the following explanation of the statement of the Kuratowski graph planarity criterion and of 6/7 of the statement of the Robertson-Seymour-Thomas intrinsic linking criterion. Let us call a cell complex 'dichotomial' if to every…

For any $\Lambda>0$, let $\mathcal{M}_{n,\Lambda}$ denote the space containing all locally Lipschitz minimal graphs of dimension $n$ and of arbitrary codimension $m$ in Euclidean space $\mathbb{R}^{n+m}$ with uniformly bounded 2-dilation…

This paper introduces a geometric representation of hypergraphs by representing hyperedges as simplices. Building on this framework, we employ homotopy groups to analyze the topological structure of hypergraphs embedded in high-dimensional…

In 1933, Karol Borsuk asked whether each bounded set in the $n$-dimensional Euclidean space can be divided into $n$+1 parts of smaller diameter. Because it would not make sense otherwise, one usually assumes that he just forgot to require…

A general position map $f:K\to M$ of a $k$-dimensional simplicial complex to a $2k$-dimensional manifold (for $k=1$, of a graph to a surface) is a $\mathbb Z_2$-embedding if $|f\sigma \cap f\tau|$ is even for any non-adjacent $k$-faces…

The structure of graphs with a 2-vertex-cut that are critical with respect to the Euler genus is studied. A general theorem describing the building blocks is presented. These constituents, called hoppers and cascades, are classified for the…

We survey Bernstein-type theorems for graphical surfaces in the Euclidean space and the Lorentz-Minkowski space. More specifically, we explain several proofs of the Bernstein theorem for minimal graphs in the Euclidean 3-space. Furthermore,…

It is well known that an $m$-dimensional Riemannian manifold can be locally isometrically embedded into the $m+1$-dimensional Euclidean space if and only if there exists a symmetric 2-tensor field satisfying the Gauss and Codazzi equations.…

We extend the edge version of the classical Menger's Theorem for undirected graphs to $n$-dimensional simplicial complexes with chains over the field $\mathbb{F}_2$. The classical Menger's Theorem states that two different vertices in an…

Due to Janet-Cartan's theorem, any analytic Riemannian manifolds can be locally isometrically embedded into a sufficiently high dimensional Euclidean space. However, for an individual Riemannian manifold (M,g), it is in general hard to…

A method for embedding graphs in Euclidean space is suggested. The method connects nodes to their geographically closest neighbors and economizes on the total physical length of links. The topological and geometrical properties of…

A well-known theorem of Assouad states that metric spaces satisfying the doubling property can be snowflaked and bi-Lipschitz embedded into Euclidean spaces. Due to the invariance of many geometric properties under bi-Lipschitz maps, this…

Embedding graphs in a geographical or latent space, i.e.\ inferring locations for vertices in Euclidean space or on a smooth manifold or submanifold, is a common task in network analysis, statistical inference, and graph visualization. We…

The classical Heawood inequality states that if the complete graph $K_n$ on $n$ vertices is embeddable in the sphere with $g$ handles, then $g \ge\dfrac{(n-3)(n-4)}{12}$. A higher-dimensional analogue of the Heawood inequality is the…

Given a simplicial complex $K$, we consider several notions of geometric complexity of embeddings of $K$ in a Euclidean space ${\mathbb R}^d$: thickness, distortion, and refinement complexity (the minimal number of simplices needed for a PL…

Graph embedding is a powerful method in parallel computing that maps a guest network $G$ into a host network $H$. The performance of an embedding can be evaluated by certain parameters, such as the dilation, the edge congestion and the…

Dot product embeddings take a graph and construct vectors for nodes such that dot products between two vectors give the strength of the edge. Dot products make a strong transitivity assumption, however, many important forces generating…

The current article considers Mayer cluster integrals of n-dimensional hard particles in the n>1 dimensional flat Euclidean space. Extending results from Wertheim and Rosenfeld, we proof that the graphs are completely reducible into 1- and…