English
Related papers

Related papers: Regular embeddings of multigraphs

200 papers

We prove that for any parameter r an r-locally 2-connected graph G embeds r-locally planarly in a surface if and only if a certain matroid associated to the graph G is co-graphic. This extends Whitney's abstract planar duality theorem from…

Combinatorics · Mathematics 2020-11-20 Johannes Carmesin

An embedding of a graph into $\mathbb{R}^3$ is said to be linear, if any edge of the graph is sent to be a line segment. And we say that an embedding $f$ of a graph $G$ into $\mathbb{R}^3$ is free, if $\pi_1(\mathbb{R}^3-f(G))$ is a free…

Geometric Topology · Mathematics 2014-09-25 Youngsik Huh , Jung Hoon Lee

Given a graph G, we construct a convex polytope whose face poset is based on marked subgraphs of G. Dubbed the graph multiplihedron, we provide a realization using integer coordinates. Not only does this yield a natural generalization of…

Quantum Algebra · Mathematics 2015-06-16 Satyan L. Devadoss , Stefan Forcey

An embedding of a graph on a translation surface is said to be \emph{systolic} if each vertex of the graph corresponds to a singular point (or marked point) and each edge corresponds to a shortest saddle connection on the translation…

Geometric Topology · Mathematics 2025-07-15 Achintya Dey , Bidyut Sanki

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…

Geometric Topology · Mathematics 2016-06-03 Dmitry Tonkonog

A graph is said to be globally rigid in $d$-dimensional space if almost all of its embeddings are unique up to isometries. If a graph has enough automorphisms to send any of its vertices into any other, then it is called vertex-transitive.…

Combinatorics · Mathematics 2026-01-19 Angelo El Saliby

We study some graphs associated to a surface, called k-multicurve graphs, which interpolate between the curve complex and the pants graph. Our main result is that, under certain conditions, simplicial embeddings between multicurve graphs…

Geometric Topology · Mathematics 2016-04-01 Viveka Erlandsson , Federica Fanoni

Graph embeddings, wherein the nodes of the graph are represented by points in a continuous space, are used in a broad range of Graph ML applications. The quality of such embeddings crucially depends on whether the geometry of the space…

Machine Learning · Statistics 2022-02-03 Francesco Di Giovanni , Giulia Luise , Michael Bronstein

We show that the topological full group of a Hausdorff ample groupoid with compact unit space coincides with the group of homotopy classes of invertible isometries in pseudofunction algebras associated with the groupoid. Moreover, if the…

Operator Algebras · Mathematics 2025-11-19 Eusebio Gardella , Mathias Palmstrøm , Hannes Thiel

Let $K$ be a differential field over $\C$ with derivation $D$, $G$ a finite linear automorphism group over $K$ which preserves $D$, and $K^G$ the fixed point subfield of $K$ under the action of $G$. We show that every finite-dimensional…

Quantum Algebra · Mathematics 2013-12-18 Kenichiro Tanabe

We show that the groupoids of two directed graphs are isomorphic if and only if the two graphs are orbit equivalent by an orbit equivalence that preserves isolated eventually periodic points. We also give a complete description of the…

Dynamical Systems · Mathematics 2018-10-08 Toke Meier Carlsen , Marius Lie Winger

We study the following problem: Given $k$ paths that share the same vertex set, is there a simultaneous geometric embedding of these paths such that each individual drawing is monotone in some direction? We prove that for any dimension $d…

Let $G$ be a connected graph on $n$ vertices and $1 \le k \le n-1$ an integer. The $k$-token graph of $G$ is the graph $F_k(G)$ whose vertices are all the $k$-subsets of vertices of $G$, two of which are adjacent whenever their symmetric…

The disk graph of a handlebody H of genus g at least 2 with m marked points on the boundary is the graph whose vertices are isotopy classes of disks disjoint from the marked points and where two vertices are connected by an edge if they can…

Geometric Topology · Mathematics 2021-06-11 Ursula Hamenstädt

This paper is devoted to the construction of norm-preserving maps between bounded cohomology groups. For a graph of groups with amenable edge groups we construct an isometric embedding of the direct sum of the bounded cohomology of the…

Circulant graphs are a widely studied family of graphs whose members possess varying amounts of symmetry. Although considerable progress has been made in finding the automorphism groups of circulant graphs under certain restrictions, a…

Combinatorics · Mathematics 2026-05-15 Sally Cockburn , Ryhory Hatavets , Will Swartz

A random group contains many subgroups which are isomorphic to the fundamental group of a compact hyperbolic 3-manifold with totally geodesic boundary. These subgroups can be taken to be quasi-isometrically embedded. This is true both in…

Group Theory · Mathematics 2017-02-23 Danny Calegari , Henry Wilton

Let f, g be two homotopic smooth embeddings of a closed surface in a closed oriented 5-dimensional manifold. We show that if f admits a common algebraic dual 3-sphere, or if the fundamental group of the ambient space is trivial, then f and…

Geometric Topology · Mathematics 2026-03-10 Ruoyu Qiao

Let $G$ be a group. The directed endomorphism graph, \dend of $G$ is a directed graph with vertex set $G$ and there is a directed edge from the vertex `$a$' to the vertex `$\, b$' $(a \neq b) $ if and only if there exists an endomorphism on…

Combinatorics · Mathematics 2025-12-16 Midhuna V Ajith , Mainak Ghosh , Aparna Lakshmanan S

In this paper we study the property of generic global rigidity for frameworks of graphs embedded in d-dimensional complex space and in a d-dimensional pseudo-Euclidean space ($R^d$ with a metric of indefinite signature). We show that a…

Metric Geometry · Mathematics 2017-08-29 Steven J. Gortler , Dylan P. Thurston