Related papers: Graph Varieties in High Dimension
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…
We investigate the property of a spatial graph of having a leveled embedding and characterize the abstract graphs with this property. We show that all leveled embeddings are free and we compare leveled and paneled (also known as flat)…
We introduce and study embeddings of graphs in finite projective planes, and present related results for some families of graphs including complete graphs and complete bipartite graphs. We also make connections between embeddings of graphs…
Consider an ergodic unimodular random one-ended planar graph $\G$ of finite expected degree. We prove that it has an isometry-invariant locally finite embedding in the Euclidean plane if and only if it is invariantly amenable. By "locally…
Graph embeddings have emerged as a powerful tool for representing complex network structures in a low-dimensional space, enabling the use of efficient methods that employ the metric structure in the embedding space as a proxy for the…
The representation complexity of a bipartite graph $G=(P,Q)$ is the minimum size $\sum_{i=1}^s (|A_i|+|B_i|)$ over all possible ways to write $G$ as a (not necessarily disjoint) union of complete bipartite subgraphs $G=\cup_{i=1}^s…
We define, for any graph $G=(V,E)$, a boundary $\partial G \subseteq V$. The definition coincides with what one would expected for the discretization of (sufficiently nice) Euclidean domains and contains all vertices from the…
Learning efficient graph representation is the key to favorably addressing downstream tasks on graphs, such as node or graph property prediction. Given the non-Euclidean structural property of graphs, preserving the original graph data's…
Let $k$ be an algebraically closed field and ${\sf G}(2,k^4)$ the Grassmannian of 2-planes in $k^4$. We associate to each 6-dimensional subspace $R$ of the space of 4x4 matrices over $k$ a closed subscheme ${\bf X}_R \subseteq {\sf…
A graph drawing in the plane is called an almost embedding if images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. We introduce integer invariants of almost embeddings: winding number, cyclic and triodic Wu…
The number of embeddings of minimally rigid graphs in $\mathbb{R}^D$ is (by definition) finite, modulo rigid transformations, for every generic choice of edge lengths. Even though various approaches have been proposed to compute it, the gap…
We solve the following problem: Can an undirected weighted graph G be parti- tioned into two non-empty induced subgraphs satisfying minimum constraints for the sum of edge weights at vertices of each subgraph? We show that this is possible…
Graph embeddings have become a key and widely used technique within the field of graph mining, proving to be successful across a broad range of domains including social, citation, transportation and biological. Graph embedding techniques…
In this paper we introduce a graph structure, called subspace sum graph $\mathcal{G}(\mathbb{V})$ on a finite dimensional vector space $\mathbb{V}$ where the vertex set is the collection of non-trivial proper subspaces of a vector space and…
We study the problem of finding the minimal (maximal) genus for a surface where a given four-valent graph with fixed opposite edge structure can be embedded into. We find several partial relations and give new reformulations in…
The \emph{segment number} of a planar graph is the smallest number of line segments whose union represents a crossing-free straight-line drawing of the given graph in the plane. The segment number is a measure for the visual complexity of a…
It is known that graphs cellularly embedded into surfaces are equivalent to ribbon graphs. In this work, we generalize this statement to broader classes of graphs and surfaces. Half-edge graphs extend abstract graphs and are useful in…
For a given graph $H$, its subdivisions carry the same topological structure. The existence of $H$-subdivisions within a graph $G$ has deep connections with topological, structural and extremal properties of $G$. One prominent example of…
The pinched sphere is the pseudo-surface $\mathbb{S}^{\circ}_0$ obtained by identifying two distinct points of the sphere. We provide a structural characterization of graphs excluding an $\mathbb{S}^{\circ}_0$-embeddable graph as a minor.…
An ordinary voltage graph embedding of a graph in a surface encodes a certain kind of highly symmetric covering space of that surface. Given an ordinary voltage graph embedding of a graph $G$ in a surface with voltage group $A$ and a…