Related papers: Embedding products of graphs into Euclidean spaces
A set of vertices $S$ resolves a graph if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The metric dimension of a graph is the minimum cardinality of a resolving set of the graph. Fix a connected…
We analyse an extremal question on the degrees of the link graphs of a finite regular graph, that is, the subgraphs induced by non-trivial spheres. We show that if $G$ is $d$-regular and connected but not complete then some link graph of…
In this paper, we are concerned with the existence of local isometric embeddings into Euclidean space for analytic Riemannian metrics $g$, defined on a domain $U\subset \mathbf{R}^n$, which are singular in the sense that the determinant of…
The Bandwidth Theorem of B\"ottcher, Schacht and Taraz [Mathematische Annalen 343 (1), 175-205] gives minimum degree conditions for the containment of spanning graphs H with small bandwidth and bounded maximum degree. We generalise this…
According to a classical result of Szemer\'{e}di, every dense subset of $1,2,...,N$ contains an arbitrary long arithmetic progression, if $N$ is large enough. Its analogue in higher dimensions due to F\"urstenberg and Katznelson says that…
We initiate the algorithmic study of retracting a graph into a cycle in the graph, which seeks a mapping of the graph vertices to the cycle vertices, so as to minimize the maximum stretch of any edge, subject to the constraint that the…
We show that the Cayley graph of the symmetric group $Sym_n$ generated by the cycle $(123...n)$ and the transposition $(12)$ embeds into $L_1$ with bi-Lipschitz distortion $O(1)$. This answers a question of Ostrovskii, and along with…
Many problems in combinatorial geometry can be formulated in terms of curves or surfaces containing many points of a cartesian product. In 2000, Elekes and R\'onyai proved that if the graph of a polynomial contains $cn^2$ points of an…
We study graph spanners for point-set in the high-dimensional Euclidean space. On the one hand, we prove that spanners with stretch <\sqrt{2} and subquadratic size are not possible, even if we add Steiner points. On the other hand, if we…
We show how to reduce the problem of symplectically embedding one 4-dimensional rational ellipsoid into another to a problem of embedding disjoint unions of balls into appropriate blow ups of \C P^2. For example, the problem of embedding…
Low-dimensional embeddings are essential for machine learning tasks involving graphs, such as node classification, link prediction, community detection, network visualization, and network compression. Although recent studies have identified…
It is largely agreed that social network links are formed due to either homophily or social influence. Inspired by this, we aim at understanding the generation of links via providing a novel embedding-based graph formation model. Different…
We investigate certain $4$-dimensional analogues of the classical $3$-dimensional Dehn's lemma, giving examples where such analogues do or do not hold, in the smooth and topological categories. In particular, we show that an essential…
We prove that every $n$-point metric space of negative type (and, in particular, every $n$-point subset of $L_1$) embeds into a Euclidean space with distortion $O(\sqrt{\log n} \cdot\log \log n)$, a result which is tight up to the iterated…
Consider a finite connected $2$-complex $X$ endowed with a piecewise Riemannian metric and whose fundamental group is freely indecomposable, of rank at least $3$, and in which every $2$-generated subgroup is free. In this paper we show that…
Firstly, we characterise the embeddability of simply connected locally 3-connected 2-dimensional simplicial complexes in 3-space in a way analogous to Kuratowski's characterisation of graph planarity, by nine excluded minors. This answers…
We refine the result of T. Lam \cite{L} on embedding the space $E_n$ of electrical networks on a planar graph with $n$ boundary points into the totally non-negative Grassmannian $\mathrm{Gr}_{\geq 0}(n-1,2n)$ by proving first that the image…
We present a comprehensive extension of the latent position network model known as the random dot product graph to accommodate multiple graphs -- both undirected and directed -- which share a common subset of nodes, and propose a method for…
We prove a discrete Jordan-Brouwer-Schoenflies separation theorem telling that a (d-1)-sphere H embedded in a d-sphere G defines two different connected graphs A,B in G such a way that the intersection of A and B is H and the union is G and…
We prove essentially sharp bounds for Ramsey numbers of ordered hypergraph matchings, inroduced recently by Dudek, Grytczuk, and Ruci\'{n}ski. Namely, for any $r \ge 2$ and $n \ge 2$, we show that any collection $\mathcal H$ of $n$ pairwise…