English
Related papers

Related papers: A simple and elementary proof of Whitney's unique …

200 papers

Planar Embedding is a drawing of a graph on the plane such that the edges do not intersect each other except at the vertices. We know that testing the planarity of a graph and computing its embedding (if it exists), can efficiently be…

Data Structures and Algorithms · Computer Science 2023-07-19 Samir Datta , Asif Khan , Anish Mukherjee

We prove that if a unimodular random graph is almost surely planar and has finite expected degree, then it has a combinatorial embedding into the plane which is also unimodular. This implies the claim in the title immediately by a theorem…

Probability · Mathematics 2025-02-14 Adam Timar

We prove that the ends of a properly immersed simply or one connected minimal surface in H(2)xR contained in a slab of height less than \pi of H(2)xR, are multi-graphs. When such a surface is embedded then the ends are graphs. When embedded…

Differential Geometry · Mathematics 2013-04-09 Pascal Collin , Laurent Hauswirth , Harold Rosenberg

We prove a version of Whitney's strong embedding theorem for isometric embeddings within the general setting of the Nash-Kuiper h-principle. More precisely, we show that any $n$-dimensional smooth compact manifold admits infinitely many…

Differential Geometry · Mathematics 2023-06-26 Wentao Cao , László Székelyhidi

We show that finding orthogonal grid-embeddings of plane graphs (planar with fixed combinatorial embedding) with the minimum number of bends in the so-called Kandinsky model (which allows vertices of degree $> 4$) is NP-complete, thus…

Computational Geometry · Computer Science 2014-05-12 Thomas Bläsius , Guido Brückner , Ignaz Rutter

Thomassen formulated the following conjecture: Every $3$-connected cubic graph has a red-blue vertex coloring such that the blue subgraph has maximum degree $1$ (that is, it consists of a matching and some isolated vertices) and the red…

Combinatorics · Mathematics 2019-02-01 János Barát

A graph is called (generically) rigid in $\mathbb{R}^d$ if, for any choice of sufficiently generic edge lengths, it can be embedded in $\mathbb{R}^d$ in a finite number of distinct ways, modulo rigid transformations. Here we deal with the…

Computational Geometry · Computer Science 2017-01-26 Ioannis Z. Emiris , Ioannis Psarros

Pointed pseudo-triangulations are planar minimally rigid graphs embedded in the plane with pointed vertices (adjacent to an angle larger than 180 degrees. In this paper we prove that the opposite statement is also true, namely that planar…

We generalize the Guth--Katz joints theorem from lines to varieties. A special case says that $N$ planes (2-flats) in 6 dimensions (over any field) have $O(N^{3/2})$ joints, where a joint is a point contained in a triple of these planes not…

Combinatorics · Mathematics 2022-06-03 Jonathan Tidor , Hung-Hsun Hans Yu , Yufei Zhao

A graph G is intrinsically S^1-linked if for every embedding of the vertices of G into S^1, vertices that form the endpoints of two disjoint edges in G form a non-split link in the embedding. We show that a graph is intrinsically S^1-linked…

Geometric Topology · Mathematics 2007-07-25 Chris Cicotta , Joel Foisy , Tom Reilly , Sara Revzi , Ben Wang , Alice Wilson

We introduce and study embeddings of graphs in finite projective planes, and present related results for some families of graphs including complete graphs and complete bipartite graphs. We also make connections between embeddings of graphs…

Combinatorics · Mathematics 2013-10-02 Keith Mellinger , Ryan Vaughn , Oscar Vega

The Bandwidth Theorem of B\"ottcher, Schacht and Taraz [Mathematische Annalen 343 (1), 175-205] gives minimum degree conditions for the containment of spanning graphs H with small bandwidth and bounded maximum degree. We generalise this…

Combinatorics · Mathematics 2013-05-10 Julia Böttcher , Anusch Taraz , Andreas Würfl

This is an appendix to arXiv:1610.04888, "Quantitative null-cobordism", which improves one of the main results of that paper to a near-sharp one. It is not a self-contained paper.

Geometric Topology · Mathematics 2018-05-17 Fedor Manin , Shmuel Weinberger

Given a planar graph G and a sequence C_1,...,C_q, where each C_i is a family of vertex subsets of G, we wish to find a plane embedding of G, if any exists, such that for each i in {1,...,q}, there is a face F_i in the embedding whose…

Data Structures and Algorithms · Computer Science 2007-05-23 Zhi-Zhong Chen , Xin He , Ming-Yang Kao

In \cite{4} Kauffman and Vogel constructed a rigid vertex regular isotopy invariant for unoriented four-valent graphs embedded in three dimensional space. It assigns to each embedded graph $G$ a polynomial, denoted $[G]$, in three…

Geometric Topology · Mathematics 2007-05-23 Rui Pedro Carpentier

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

This is a short note describing what I believe is a serious gap in Stanfield's proof of Sachs' conjecture that every linklessly embeddable graph has a linear linkless embedding in $\mathbb{R}^3$.

Geometric Topology · Mathematics 2026-03-12 Ramin Naimi

In this paper we give two examples of sequences of embedded minimal planar domains in $\mathbb{R}^3$ which converge to singular laminations of $\mathbb{R}^3$. In contrast with the situation for embedded minimal disks, these examples do not…

Differential Geometry · Mathematics 2016-05-27 Jacob Bernstein

A stratification of a singular set, e.g. an algebraic or analytic variety, is, roughly, a partition of it into manifolds so that these manifolds fit together "regularly". A classical theorem of Whitney says that any complex analytic set has…

Algebraic Geometry · Mathematics 2007-05-23 Vadim Kaloshin

This paper is concerned with long-time interest of us, especially, the author, in realizing graphs as Reeb graphs of real algebraic functions of certain nice classes. The Reeb graph of a differentiable function is the set consisting of all…

Algebraic Geometry · Mathematics 2025-09-05 Naoki Kitazawa