English
Related papers

Related papers: Embedding products of graphs into Euclidean spaces

200 papers

For a fixed $K\gg 1$ and $n\in\mathbb{N}$, $n\gg 1$, we study metric spaces which admit embeddings with distortion $\le K$ into each $n$-dimensional Banach space. Classical examples include spaces embeddable into $\log n$-dimensional…

Functional Analysis · Mathematics 2016-08-10 Mikhail I. Ostrovskii , Beata Randrianantoanina

A clear understanding of topology of higher-dimensional objects is important in many branches of both pure and applied mathematics. In this survey we attempt to present some results of higher-dimensional topology in a way which makes clear…

Geometric Topology · Mathematics 2008-12-06 A. Skopenkov

In this paper we are interested in an intrinsic property of graphs which is derived from their embeddings into the Euclidean 3-space $\mathbb{R}^3$. An embedding of a graph into $\mathbb{R}^3$ is said to be linear, if it sends every edge to…

Geometric Topology · Mathematics 2022-06-24 Youngsik Huh , Jung Hoon Lee

We consider sufficient conditions for the existence of $k$-th powers of Hamiltonian cycles in $n$-vertex graphs $G$ with minimum degree $\mu n$ for arbitrarily small $\mu>0$. About 20 years ago Koml\'os, Sark\"ozy, and Szemer\'edi resolved…

Combinatorics · Mathematics 2019-10-01 Oliver Ebsen , Giulia S. Maesaka , Christian Reiher , Mathias Schacht , Bjarne Schülke

We study embeddings of the unit sphere of complex Hilbert spaces of dimension a power $2^n$ into the corresponding groups of non-singular linear transformations. For the case of $n=1$, the sphere $S_2$ of qubits is identified with…

Quantum Physics · Physics 2016-11-15 Dalia Cervantes , Guillermo Morales-Luna

Rigid frameworks in some Euclidian space are embedded graphs having a unique local realization (up to Euclidian motions) for the given edge lengths, although globally they may have several. We study the number of distinct planar embeddings…

Metric Geometry · Mathematics 2007-05-23 Ciprian Borcea , Ileana Streinu

Ramsey proved that for every positive integer $n$, every sufficiently large graph contains an induced $K_n$ or $\overline{K}_n$. Among the many extensions of Ramsey's Theorem there is an analogue for connected graphs: for every positive…

Combinatorics · Mathematics 2023-06-16 Sarah Allred , Guoli Ding , Bogdan Oporowski

The intent of this article is to study some special $n$-dimensional continua lying in products of $n$ curves. (The paper is an improved version of a portion of \cite{K-K-S}.) We show that if $X$ is a locally connected, so-called, quasi…

Geometric Topology · Mathematics 2008-02-25 A. Koyama , J. Krasinkiewicz , S. Spiez

We provide a simple characterization of simplicial complexes on few vertices that embed into the $d$-sphere. Namely, a simplicial complex on $d+3$ vertices embeds into the $d$-sphere if and only if its non-faces do not form an intersecting…

Combinatorics · Mathematics 2023-11-10 Florian Frick , Mirabel Hu , Verity Scheel , Steven Simon

Define the complete n-complex on N vertices to be the n-skeleton of an (N-1)-simplex. We show that embeddings of sufficiently large complete n-complexes in R^{2n+1} necessarily exhibit complicated linking behaviour, thereby extending known…

Geometric Topology · Mathematics 2014-10-01 Christopher Tuffley

Some graphs admit drawings in the Euclidean k-space in such a (natu- ral) way, that edges are represented as line segments of unit length. Such drawings will be called k dimensional unit distance representations. When two non-adjacent…

Combinatorics · Mathematics 2010-01-07 Jan Kratochvil , Boris Horvat , Tomaz Pisanski

We say that a graph $F$ can be embedded into a graph $G$ if $G$ contains an isomorphic copy of $F$ as a subgraph. Guo and Volkmann \cite{GV} conjectured that if $G$ is a connected graph with at least $n$ vertices and minimum degree at least…

Combinatorics · Mathematics 2022-01-03 Zilong Yan , Yuejian Peng

We prove that any \(2\)-connected graph \(G\) on \(n\) vertices with minimum degree \(\delta(G) \ge \frac{n}{4}+2\) contains a \(2\)-connected subgraph of order \(k\) for every integer \(k\) with \(4 \le k \le n\). This improves a previous…

Combinatorics · Mathematics 2026-03-13 Haiyang Liu , Bo Ning

To what extent is it possible to visualize high-dimensional data in two- or three-dimensional plots? We reframe this question in terms of embedding $n$-vertex graphs (representing the neighborhood structure of the input points) into metric…

Computational Geometry · Computer Science 2026-01-19 Szymon Snoeck , Noah Bergam , Nakul Verma

Let M be a complete non-compact connected Riemannian n-dimensional manifold. We first prove that, for any fixed point p in M, the radial Ricci curvature of M at p is bounded from below by the radial curvature function of some non-compact…

Differential Geometry · Mathematics 2011-06-09 Kei Kondo , Minoru Tanaka

The core of this note is the observation that links between circle packings of graphs and potential theory developed in \cite{BeSc01} and \cite{HS} can be extended to higher dimensions. In particular, it is shown that every limit of finite…

Probability · Mathematics 2010-10-14 Itai Benjamini , Nicolas Curien

We propose a novel node embedding of directed graphs to statistical manifolds, which is based on a global minimization of pairwise relative entropy and graph geodesics in a non-linear way. Each node is encoded with a probability density…

Machine Learning · Computer Science 2020-02-07 Thorben Funke , Tian Guo , Alen Lancic , Nino Antulov-Fantulin

Let $N$ be a closed orientable connected $n$-manifold, $n\ge 4$. We classify embeddings of the punctured manifold $N_0$ into $\R^{2n-1}$ up to isotopy. Our result in some sense extends results of J.C. Becker -- H.H. Glover (1971) and O.…

Geometric Topology · Mathematics 2010-10-21 Dmitry Tonkonog

We consider {\em monotone} embeddings of a finite metric space into low dimensional normed space. That is, embeddings that respect the order among the distances in the original space. Our main interest is in embeddings into Euclidean…

Combinatorics · Mathematics 2007-05-23 Yonatan Bilu , Nati Linial

The limited connectivity of current and next-generation quantum annealers motivates the need for efficient graph-minor embedding methods. These methods allow non-native problems to be adapted to the target annealer's architecture. The…

Discrete Mathematics · Computer Science 2016-07-12 Arman Zaribafiyan , Dominic J. J. Marchand , Seyed Saeed Changiz Rezaei