English
Related papers

Related papers: Toroidal Embeddings of non-Intrinsically-Linked Gr…

200 papers

Motivated by the problem of determining unknotted routes for the scaffolding strand in DNA origami self-assembly, we examine existence and knottedness of A-trails in graphs embedded on the torus. We show that any A-trail in a…

Those maps of a closed surface to the three-dimensional torus that are homotopic to embeddings are characterized. Particular attention is paid to the somewhat intricate case when the surface is nonorientable.

Geometric Topology · Mathematics 2007-05-23 Allan L. Edmonds

We prove two results on the classification of trivial Legendrian embeddings $g: G \rightarrow (S^3,\xi_{std})$ of planar graphs. First, the oriented Legendrian ribbon $R_g$ and rotation invariant $\text{rot}_g$ are a complete set of…

Geometric Topology · Mathematics 2016-04-05 Peter Lambert-Cole , Danielle O'Donnol

In an $\mathsf{L}$-embedding of a graph, each vertex is represented by an $\mathsf{L}$-segment, and two segments intersect each other if and only if the corresponding vertices are adjacent in the graph. If the corner of each…

Computational Geometry · Computer Science 2017-03-07 Abu Reyan Ahmed , Felice De Luca , Sabin Devkota , Alon Efrat , Md Iqbal Hossain , Stephen Kobourov , Jixian Li , Sammi Abida Salma , Eric Welch

A graph $G=(V,E)$ is geometrically embeddable into a normed space $X$ when there is a mapping $\zeta: V\to X$ such that $\|\zeta(v)-\zeta(w)\|_X\leqslant 1$ if and only if $\{v,w\}\in E$, for all distinct $v,w\in V$. Our result is the…

Combinatorics · Mathematics 2026-04-20 Dylan J. Altschuler , Pandelis Dodos , Konstantin Tikhomirov , Konstantinos Tyros

A graph $G$ is a non-separating planar graph if there is a drawing $D$ of $G$ on the plane such that (1) no two edges cross each other in $D$ and (2) for any cycle $C$ in $D$, any two vertices not in $C$ are on the same side of $C$ in $D$.…

Combinatorics · Mathematics 2019-07-24 Hooman R. Dehkordi , Graham Farr

We establish that every embedding of a Grassmann graph in a polar Grassmann graph can be reduced to an embedding in a Grassmann graph or to an embedding in the collinearity graph of a polar space. Also, we consider $3$-embeddings, i.e.…

Combinatorics · Mathematics 2015-03-16 Mark Pankov

We investigate the toroidal expanse of an embedded graph G, that is, the size of the largest toroidal grid contained in G as a minor. In the course of this work we introduce a new embedding density parameter, the stretch of an embedded…

Combinatorics · Mathematics 2019-06-06 Markus Chimani , Petr Hlineny , Gelasio Salazar

Tutte's embedding theorem states that every 3-connected graph without a $K_5$ or $K_{3,3}$ minor (i.e. a planar graph) is embedded in the plane if the outer face is in convex position and the interior vertices are convex combinations of…

Computational Geometry · Computer Science 2023-03-28 Marc Alexa

A graph G is weakly 4-connected if it is 3-connected, has at least five vertices, and for every pair of sets (A,B) with union V(G) and intersection of size three such that no edge has one end in A-B and the other in B-A, one of the induced…

Combinatorics · Mathematics 2014-01-14 Rajneesh Hegde , Robin Thomas

A graph $G$ of constant link $L$ is a graph in which the neighborhood of any vertex induces a graph isomorphic to $L$. Given two different graphs, $H$ and $G$, the induced Tur\'an number ${\rm ex}(n; H, G{\rm -ind})$ is defined as the…

Combinatorics · Mathematics 2024-09-20 Yair Caro , Adriana Hansberg , Zsolt Tuza

Consider a weighted, undirected graph cellularly embedded on a topological surface. The function assigning to each free homotopy class of closed curves the length of a shortest cycle within this homotopy class is called the marked length…

Computational Geometry · Computer Science 2023-03-15 Vincent Delecroix , Matthijs Ebbens , Francis Lazarus , Ivan Yakovlev

It has been recently shown that any graph of genus g>0 can be stochastically embedded into a distribution over planar graphs, with distortion Olog (g+1)) [Sidiropoulos, FOCS 2010]. This embedding can be computed in polynomial time, provided…

Data Structures and Algorithms · Computer Science 2012-06-22 Yury Makarychev , Anastasios Sidiropoulos

Let the crown $C_{13}$ be the linear $3$-graph on $9$ vertices $\{a,b,c,d,e,f,g,h,i\}$ with edges $$E = \{\{a,b,c\}, \{a, d,e\}, \{b, f, g\}, \{c, h,i\}\}.$$ Proving a conjecture of Gy\'arf\'as et. al., we show that for any crown-free…

Combinatorics · Mathematics 2021-10-06 Chaoliang Tang , Hehui Wu , Shengtong Zhang , Zeyu Zheng

We introduce the concept of tied links in the solid torus, which generalize naturally the concept of tied links in $S^3$ previously introduced by Aicardi and Juyumaya. We also define an invariant of these tied links by using skein…

Rings and Algebras · Mathematics 2019-10-25 Marcelo Flores

In this paper, we show that if $G$ is $3$-connected, then the Cartesian product of graphs $G \square H$ embeds on the torus if and only if $G$ is outer-cylindrical and $H$ is a path on two vertices, $P_2$. As a by-product of our work, we…

Combinatorics · Mathematics 2026-04-22 Elizabeth Badgett , Christian Millichap , Kenta Noguchi

A drawing in the plane ($\mathbb{R}^2$) of a graph $G=(V,E)$ equipped with a function $\gamma: V \rightarrow \mathbb{N}$ is \emph{$x$-bounded} if (i) $x(u) <x(v)$ whenever $\gamma(u)<\gamma(v)$ and (ii) $\gamma(u)\leq\gamma(w)\leq…

Computational Geometry · Computer Science 2016-10-25 Radoslav Fulek

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…

Probability · Mathematics 2021-10-27 Itai Benjamini , Adam Timar

Echeverria recently introduced an invariant for a smoothly embedded torus in a homology $S^1\times S^3$, using gauge theory for singular connections. We define a new topological invariant of such an embedded torus, analogous to the…

Geometric Topology · Mathematics 2022-11-02 Daniel Ruberman

We give a necessary condition for two diagrams of $3$-regular spatial graphs with the same underlying abstract graph $G$ to represent isotopic spatial graphs. The test works by reading off the writhes of the knot diagrams coming from a…

Geometric Topology · Mathematics 2024-04-16 Stefan Friedl , Tejas Kalelkar , José Pedro Quintanilha