Related papers: Constructing entire minimal graphs by evolving pla…
A minimally rigid graph, also called Laman graph, models a planar framework which is rigid for a general choice of distances between its vertices. In other words, there are finitely many ways, up to isometries, to realize such a graph in…
Let $G$ be a planar $3$-graph (i.e., a planar graph with vertex degree at most three) with $n$ vertices. We present the first $O(n^2)$-time algorithm that computes a planar orthogonal drawing of $G$ with the minimum number of bends in the…
We prove that for any open Riemann surface $N,$ natural number $n\geq 3,$ non-constant harmonic map $h:N\to \mathbb{R}^{n-2}$ and holomorphic 2-form $H$ on $N,$ there exists a weakly complete harmonic map $X=(X_j)_{j=1,\ldots,n}:N \to…
We present a complete algebraic description of the field of first-order joint projective invariants for configurations of \( n \) points in the plane, under the natural diagonal action of the projective group \( PGL(3,\mathbb{R}) \). For \(…
A well known Euler's formula consequence's corollary in graph theory states that: For a connected simple planar graph with $n$ vertices and $m$ edges, and girth $g$, we have $m \leq \frac{g}{g-2}(n-2)$. We show that a connected simple plane…
Under suitable conditions on the range of the Gauss map of a complete submanifold of Euclidean space with parallel mean curvature, we construct a strongly subharmonic function and derive a-priori estimates for the harmonic Gauss map. The…
Let $g_t$ be a smooth 1-parameter family of negatively curved metrics on a closed hyperbolic 3-manifold $M$ starting at the hyperbolic metric. We construct foliations of the Grassmann bundle $Gr_2(M)$ of tangent 2-planes whose leaves are…
A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most once. A graph, together with a 1-planar drawing is called 1-plane. Brandenburg et al. showed that there are maximal 1-planar graphs with only…
We prove that an anisotropic minimal graph over a half-space with flat boundary must itself be flat. This generalizes a result of Edelen-Wang to the anisotropic case. The proof uses only the maximum principle and ideas from fully nonlinear…
In this paper and a companion paper, we prove that, if $m$ is sufficiently large, every graph on $m+1$ vertices that has a universal vertex and minimum degree at least $\lfloor \frac{2m}{3} \rfloor$ contains each tree $T$ with $m$ edges as…
A linear mapping upon real n-dimensional space, where the dimension n is odd, has a real eigenvalue-eigenvector pair. The corresponding statement for complex vector spaces holds true for any dimension n, but should be easy to demonstrate…
For an oriented isometric immersion $f:M\to S^n$ the spherical Gauss map is the Legendrian immersion of its unit normal bundle $UM^\perp$ into the unit sphere subbundle of $TS^n$, and the geodesic Gauss map $\gamma$ projects this into the…
We prove that every locally Hamiltonian graph with $n\ge 3$ vertices and possibly with multiple edges has at least $3n-6$ edges with equality if and only if it triangulates the sphere. As a consequence, every edge-maximal embedding of a…
The purpose of this paper is to reveal the relationship between the total curvature and the global behavior of the Gauss map of a complete minimal Lagrangian surface in the complex two-space. To achieve this purpose, we show the precise…
Given any (not necessarily connected) combinatorial finite graph and any compact smooth $6$-manifold $M^6$ with the third Betti number $b_3\not=0$, we construct a calibrated 3-dimensional homologically area minimizing surface on $M$…
In this paper, we show that every $O(m)$-edge-connected simple graph $G$ of size divisible by $m$ with minimum degree at least $2^{O(m)}$ has an edge-decomposition into isomorphic copies of any given tree $T$ of size $m$. Moreover, the…
We give upper and lower bounds on the maximum and minimum number of geometric configurations of various kinds present (as subgraphs) in a triangulation of $n$ points in the plane. Configurations of interest include \emph{convex polygons},…
In this paper we present a complete characterization of the smallest sets which block all the simple perfect matchings in a complete convex geometric graph on $2m$ vertices. In particular, we show that all these sets are caterpillar graphs…
We show that every complete $n$-vertex simple topological graph contains a topological subgraph on at least $(\log n)^{1/4 - o(1)}$ vertices that is weakly isomorphic to the complete convex geometric graph or the complete twisted graph.…
We call a finite undirected graph minimally k-matchable if it has at least k distinct perfect matchings but deleting any edge results in a graph which has not. An odd subdivision of some graph G is any graph obtained by replacing every edge…