Related papers: Simplicial embeddings between pants graphs

Let $p\geq3$ be a prime and $e\geq2$ an integer. Let $\sigma(x)$ be a primitive polynomial of degree $n$ over $Z/p^eZ$ and $G'(\sigma(x),p^e)$ the set of primitive linear recurring sequences generated by $\sigma(x)$. A compressing map…

This is an exposition of results on the existence problem of $\pi_1$-injective immersed and embedded surfaces in graph-manifolds, and also of nonpositively curved metrics on graph-manifolds, obtained by different authors. The results are…

We prove that sparse string graphs in a fixed surface have linear expansion. We extend this result to the more general setting of sparse region intersection graphs over any proper minor-closed class. The proofs are combinatorial and…

In this paper, we consider the simplest class of stratified spaces -- linearly embedded graphs. We present an algorithm that learns the abstract structure of an embedded graph and models the specific embedding from a point cloud sampled…

For a graph embedded into a surface, we relate many combinatorial parameters of the cycle matroid of the graph and the bond matroid of the dual graph with the topological parameters of the embedding. This will give an expression of the…

The $W_v$-Path Conjecture due to Klee and Wolfe states that any two vertices of a simple polytope can be joined by a path that does not revisit any facet. This is equivalent to the well-known Hirsch Conjecture. Klee proved that the…

Paths P1,...,Pk in a graph G=(V,E) are said to be mutually induced if for any 1 <= i < j <= k, Pi and Pj have neither common vertices nor adjacent vertices (except perhaps their end-vertices). The Induced Disjoint Paths problem is to test…

A vertex in a graph is simplicial if its neighborhood forms a clique. We consider three generalizations of the concept of simplicial vertices: avoidable vertices (also known as \textit{OCF}-vertices), simplicial paths, and their common…

Embedding graphs in continous spaces is a key factor in designing and developing algorithms for automatic information extraction to be applied in diverse tasks (e.g., learning, inferring, predicting). The reliability of graph embeddings…

We investigate properties of spatial graphs on the standard torus. It is known that nontrivial embeddings of planar graphs in the torus contain a nontrivial knot or a nonsplit link due to [1],[2]. Building on this and using the chirality of…

We study the problem of embedding shortest-path metrics of weighted graphs into $\ell_p$ spaces. We introduce a new embedding technique based on low-depth decompositions of a graph via shortest paths. The notion of Shortest Path…

Let C be a generic curve, E a generic vector bundle on C. Then, for every line bundle on C the twisted Petri map P:H^0(C,L\otimes E)\otimes H^0(C, K\otimes L^*\otimes E^{*})--> H^0(C, K) is injective.

Ding (1992) proved that for each integer ${m} \geqslant 0$, and every infinite sequence of finite simple graphs $G_1, G_2, \ldots$, if none of these graphs contains a path of length ${m}$ as a subgraph, then there are indices $i < j$ such…

For generic maps from compact surfaces with boundary into the plane we develop an explicit algorithm for minimizing both the number of cusps and the number of components of the singular locus. More precisely, we minimize among maps with…

We show that immersed minimal surfaces of $\mathbb{R}^{3}$ with bounded curvature and proper self intersections are proper. We also show that the restriction of the immersing map to a wide component is always proper. When the immersing map…

In this paper, we present a constructive and proof-relevant development of graph theory, including the notion of maps, their faces, and maps of graphs embedded in the sphere, in homotopy type theory. This allows us to provide an elementary…

We prove that a planar graph is generically rigid in the plane if and only if it can be embedded as a pseudo-triangulation. This generalizes the main result of math.CO/0307347 which treats the minimally generically rigid case. The proof…

If a graph $G_M$ is embedded into a closed surface $S$ such that $S \backslash G_M$ is a collection of disjoint open discs, then $M=(G_M,S)$ is called a {\em map}. A {\em zigzag} in a map $M$ is a closed path which alternates choosing, at…

Planar graphs and their spatial embedding -- planar maps -- are used in many different fields due to their ubiquity in the real world (leaf veins in biology, street patterns in urban studies, etc.) and are also fundamental objects in…

We study embeddings of a graph $G$ in a surface $S$ by considering representatives of different classes of $H_1(S)$ and their intersections. We construct a matrix invariant that can be used to detect homological invariance of elements of…