Related papers: Embedding of metric graphs on hyperbolic surfaces

Let $H$ be an edge-weighted graph, and let $G$ be a subgraph of $H$. We say that $G$ is an $f$-fault-tolerant $t$-spanner for $H$, if the following is true for any subset $F$ of at most $f$ edges of $G$: For any two vertices $p$ and $q$,…

For a graph $G$ with edge set $E$, let $d(w)$ denote the degree of a vertex $w$ in $G$. The hyperbolic Sombor index of $G$ is defined by $$HSO(G)=\sum_{uv\in E}(\min\{d(u),d(v)\})^{-1}\sqrt{(d(u))^2+(d(v))^2}.$$ If $\min\{d(u),d(v)\}$ is…

Let $H$ and $G$ be graphs on $n$ vertices, where $n$ is sufficiently large. We prove that if $H$ has Ore-degree at most 5 and $G$ has minimum degree at least $2n/3$ then $H\subset G.$

We prove that there is an algorithm which determines whether or not a given 2-polyhedron can be embedded into some integral homology 3-sphere. This is a corollary of the following main result. Let $M$ be a compact connected orientable…

Many graph neural networks have been developed to learn graph representations in either Euclidean or hyperbolic space, with all nodes' representations embedded in a single space. However, a graph can have hyperbolic and Euclidean geometries…

In order to solve real world combinatorial optimization problems with a D-Wave quantum annealer it is necessary to embed the problem at hand into the D-Wave hardware graph, namely Chimera or Pegasus. Most hard real world problems exhibit a…

A graph $H$ is {\em $p$-edge colorable} if there is a coloring $\psi: E(H) \rightarrow \{1,2,\dots,p\}$, such that for distinct $uv, vw \in E(H)$, we have $\psi(uv) \neq \psi(vw)$. The {\sc Maximum Edge-Colorable Subgraph} problem takes as…

High-dimensional multiplex graphs are characterized by their high number of complementary and divergent dimensions. The existence of multiple hierarchical latent relations between the graph dimensions poses significant challenges to…

We prove the existence of $C^{1,1}$ isometric immersions of several classes of metrics on surfaces $(\mathcal{M},g)$ into the three-dimensional Euclidean space $\mathbb{R}^3$, where the metrics $g$ have strictly negative curvature. These…

In several works, Mendel and Naor have introduced and developed theory surrounding a nonlinear expansion constant similar to the spectral gap for sequences of graphs, in which one considers embeddings of a graph $G$ into a metric space $X$…

In 1965 Edmonds showed that every eulerian graph has a bi-eulerian embedding, i.e., an embedding with exactly two faces, each bounded by an euler circuit. We refine this result by giving conditions for a graph to have a bi-eulerian…

We consider relations between the size, treewidth, and local crossing number (maximum number of crossings per edge) of graphs embedded on topological surfaces. We show that an $n$-vertex graph embedded on a surface of genus $g$ with at most…

We show that a problem of deleting a minimum number of vertices from a graph to obtain a graph embeddable on a surface of a given Euler genus is solvable in time $2^{C_g \cdot k^2 \log k} n^{O(1)}$, where $k$ is the size of the deletion…

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…

We consider a surface $M$ immersed in $\mathbb{R}^3$ with induced metric $g=\psi\delta_2$ where $\delta_2$ is the two dimensional Euclidean metric. We then construct a system of partial differential equations that constrain $M$ to lift to a…

Generating graphs with hierarchical structures remains a fundamental challenge due to the limitations of Euclidean geometry in capturing exponential complexity. Here we introduce \textbf{GGBall}, a novel hyperbolic framework for graph…

Hyperbolic geometry has emerged as an effective latent space for representing complex networks, owing to its ability to capture hierarchical organization and heterogeneous connectivity patterns using low-dimensional embeddings. As a result,…

The Bratteli diagram is an infinite graph which reflects the structure of projections in a C*-algebra. We prove that every strictly ergodic unimodular Bratteli diagram of rank 2g+m-1 gives rise to a minimal geodesic lamination with the…

Graph is a ubiquitous representation of data in various research fields, and graph embedding is a prevalent machine learning technique for capturing key features and generating fixed-sized attributes. However, most state-of-the-art graph…

Graph Neural Networks (GNNs) bring the power of deep representation learning to graph and relational data and achieve state-of-the-art performance in many applications. GNNs compute node representations by taking into account the topology…