Related papers: Algebraic methods for counting Euclidean embedding…

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…

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…

We establish a strong, geometric lower bound on the (sequential) topological complexity of the unordered configuration spaces of a general graph. As an application, we show that, for most graphs, the topological complexity eventually…

Graph embedding, especially as a subgraph of a grid, is an old topic in VLSI design and graph drawing. In this paper, we investigate related questions concerning the complexity of embedding a graph $G$ in a host graph that is the strong…

A random 2-cell embedding of a given graph $G$ is obtained by choosing a random local rotation around every vertex. We analyze the expected number of faces of such an embedding, which is equivalent to studying its average genus. In 1991,…

In contrast with knots, whose properties depend only on their extrinsic topology in $S^3$, there is a rich interplay between the intrinsic structure of a graph and the extrinsic topology of all embeddings of the graph in $S^3$ . For…

Let $\Delta \ge 3$ be fixed, $n \ge n_\Delta$ be a large integer. It is a classical result that $\Delta$--regular expanders on $n$ vertices are not embeddable as geometric (distance) graphs into Euclidean space of dimension less than $c…

Graph representation learning has been widely studied and demonstrated effectiveness in various graph tasks. Most existing works embed graph data in the Euclidean space, while recent works extend the embedding models to hyperbolic or…

For a finite simplicial graph $\Gamma$, let $G(\Gamma)$ denote the right-angled Artin group on the complement graph of $\Gamma$. In this article, we introduce the notions of "induced path lifting property" and "semi-induced path lifting…

Low-dimensional representations, or embeddings, of a graph's nodes facilitate several practical data science and data engineering tasks. As such embeddings rely, explicitly or implicitly, on a similarity measure among nodes, they require…

There has been a surge of recent interest in learning representations for graph-structured data. Graph representation learning methods have generally fallen into three main categories, based on the availability of labeled data. The first,…

Graph rigidity, the study of vertex realizations in $\mathbb{R}^d$ and the motions that preserve the induced edge lengths, has been the focus of extensive research for decades. Its equivalency to graph connectivity for $d=1$ is well known;…

We prove a tight upper bound on the independence polynomial (and total number of independent sets) of cubic graphs of girth at least 5. The bound is achieved by unions of the Heawood graph, the point/line incidence graph of the Fano plane.…

In order to model entanglements of polymers in a confined region, we consider the linking numbers and writhes of cycles in random linear embeddings of complete graphs in a cube. Our main results are that for a random linear embedding of…

We study the rigidity and flexibility of symplectic embeddings of simple shapes. It is first proved that under the condition $r_n^2 \le 2 r_1^2$ the symplectic ellipsoid $E(r_1, ..., r_n)$ with radii $r_1 \le ... \le r_n$ does not embed in…

A "folklore conjecture, probably due to Tutte" (as described in [P.D. Seymour, Sums of circuits, Graph theory and related topics (Proc. Conf., Univ. Waterloo, 1977), pp. 341-355, Academic Press, 1979]) asserts that every bridgeless cubic…

For certain polynomials we relate the number of roots inside the unit circle with the index of a non-degenerate isolated umbilic point on a real analytic surface in Euclidean 3-space. In particular, for $N>0$ we prove that for a certain…

A \emph{book-embedding} of a graph $G$ is an embedding of vertices of $G$ along the spine of a book, and edges of $G$ on the pages so that no two edges on the same page intersect. the minimum number of pages in which a graph can be embedded…

Graph theoretical problems based on shortest paths are at the core of research due to their theoretical importance and applicability. This paper deals with the geodetic number which is a global measure for simple connected graphs and it…

We propose a new method for embedding graphs while preserving directed edge information. Learning such continuous-space vector representations (or embeddings) of nodes in a graph is an important first step for using network information…