Related papers: Simplicial embeddings between pants graphs
In this paper we prove that an embedded and simply connected constant mean curvature surface with curvature large at a point contains a multi-valued graph around that point on the scale of $|A|^2$, where $|A|^2$ is the norm squared of the…
Immersions of graphs to the projective plane are studied. A classification of immersions up to regular homotopy is given. A complete invariant of immersions up to regular homotopy is constructed. Equivalence classes are described.
We prove for the first time a pointwise lower estimate of the normal injectivity radius of an embedded hypersurface in an arbitrary Riemannian manifold. Main applications include: (i) a pointwise lower estimate of the graphing radius 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…
We prove that the vertex set of any twin-free multigraph G has an embedding into some point set P of some Euclidean space Rk, such that the automorphism group of G is isomorphic to the isometry group of Rk globally preserving P.
For each surface besides the sphere, projective plane, and Klein bottle, we construct a face-simple minimal quadrangulation, i.e., a simple quadrangulation on the fewest number of vertices possible, whose dual is also a simple graph. Our…
It is known that isomorphisms of graph Jacobians induce cyclic bijections on the associated graphs. We characterize when such cyclic bijections can be strengthened to graph isomorphisms, in terms of an easily computed divisor. The result…
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…
In this paper, we show that for all $k\geq 10^8$, every graph with minimum degree $k$ and girth at least $10^8$ contains an induced subdivision of a $K_{k+1}$. This answers a problem asked by K\"uhn and Osthus (originally attributed to…
We construct several families of embeddings of braid groups into mapping class groups of orientable and non-orientable surfaces and prove that they induce the trivial map in stable homology in the orientable case, but not so in the…
We present the notion of facet-complexity, $\text{C}(\mathsf{L};\mathsf{K})$, for two simplicial complexes $\mathsf{L}$ and $\mathsf{K}$, along with basic results for this numerical invariant. This invariant…
A generic immersion of a planar graph into the 2-space is said to be knotted if there does not exist a trivial embedding of the graph into the 3-space obtained by lifting the immersion with respect to the natural projection from the 3-space…
We prove that every 3-connected planar graph on $n$ vertices contains an induced path on $\Omega(\log n)$ vertices, which is best possible and improves the best known lower bound by a multiplicative factor of $\log \log n$. We deduce that…
We study approximation of probability measures supported on $n$-dimensional manifolds embedded in $\mathbb{R}^m$ by injective flows -- neural networks composed of invertible flows and injective layers. We show that in general, injective…
A unit disk graph is the intersection graph of disks of equal radii in the plane. The class of unit disk graphs is hereditary, and therefore admits a characterization in terms of minimal forbidden induced subgraphs. In spite of quite active…
Problems related to finding induced subgraphs satisfying given properties form one of the most studied areas within graph algorithms. Such problems have given rise to breakthrough results and led to development of new techniques both within…
The main point of this paper is that, under suitable conditions on the mean curvature and the Ricci curvature of the ambient space, we can extend Choi-Schoen's Compactness Theorem to compact embedded minimal surfaces to simple immersed…
We prove that Mean Value mapping between convex quadrilaterals is injective, affirmatively proving a conjecture stated in M. S. Floater and J. Kosinka, On the injectivity of Wachspress and mean value mappings between convex polygons, Adv.…
We prove that the ribbon graph polynomial of a graph embedded in an orientable surface is irreducible if and only if the embedded graph is neither the disjoint union nor the join of embedded graphs. This result is analogous to the fact that…
The Induced Disjoint Paths problem is to test whether a graph G with k distinct pairs of vertices (s_i,t_i) contains paths P_1,...,P_k such that P_i connects s_i and t_i for i=1,...,k, and P_i and P_j have neither common vertices nor…