Related papers: A generalization of Rado's Theorem for almost grap…

Let $X\subset P^n$ be a complex projective manifold of degree $d$ and arbitrary dimension. The main result of this paper gives a classification of such manifolds (assumed moreover to be connected, non-degenerate and linearly normal) in case…

Let $d \geq 2$. The Cheeger constant of a graph is the minimum surface-to-volume ratio of all subsets of the vertex set with relative volume at most 1/2. There are several ways to define surface and volume here: the simplest method is to…

Let $f(n,k)$ be the minimum number of edges that must be removed from some complete geometric graph $G$ on $n$ points, so that there exists a tree on $k$ vertices that is no longer a planar subgraph of $G$. In this paper we show that…

We present a constructive approach for approximating the conformal map (uniformization) of a polyhedral surface to a canonical domain in the plane. The main tool is a characterization of convex spaces of quasiconformal simplicial maps and…

In this paper, we build up a min-max theory for minimal surfaces using sweepouts of surfaces of genus $g\geq 2$. We develop a direct variational methods similar to the proof of the famous Plateau problem by J. Douglas and T. Rado. As a…

In this paper we prove some general results on constant mean curvature lamination limits of certain sequences of compact surfaces $M_n$ embedded in $\mathbb R^3$ with constant mean curvature $H_n$ and fixed finite genus, when the boundaries…

We prove that thick groups (and more generally thick graphs) have trivial Floyd boundary. This shows a wide class of finitely generated groups that are non-relatively hyperbolic have trivial Floyd boundary. In addition to giving new…

We obtain isometric minimal helicoidal and rotational surfaces using generalized Bour's theorem in three dimensional Minkowski space. In addition, we show that the surfaces preserve minimality when their Gauss maps identically equal,…

In [15], Jean Taylor has proved a regularity theorem away from boundary for Almgren almost minimal sets of dimension two in $\mathbb{R}^{3}$. It is quite important for understanding the soap films and the solutions of Plateau's problem away…

Simple drawings are drawings of graphs in which the edges are Jordan arcs and each pair of edges share at most one point (a proper crossing or a common endpoint). We introduce a special kind of simple drawings that we call generalized…

We prove several variations on the results of Ricci and Travaglini concerning bounds for convolution with all rotations of a measure supported by a fixed convex curve in the plane. Estimates are obtained for averages over higher-dimensional…

We survey Bernstein-type theorems for graphical surfaces in the Euclidean space and the Lorentz-Minkowski space. More specifically, we explain several proofs of the Bernstein theorem for minimal graphs in the Euclidean 3-space. Furthermore,…

This paper presents a complete classification of minimal graph surfaces that admit graphical transformations into other minimal surfaces. These transformations are functions that map the height function of a minimal graph surface to another…

We construct harmonic diffeomorphisms from the complex plane $C$ onto any Hadamard surface $M$ whose curvature is bounded above by a negative constant. For that, we prove a Jenkins-Serrin type theorem for minimal graphs in $M\times R$ over…

We prove some results concerning Alcuin number of graphs. First, we classify graphs which have unique minimum vertex cover. Then we present two necessary conditions for a graph to be of class two and show why one of them (condition on…

We construct geometric barriers for minimal graphs in H^n xR. We prove the existence and uniqueness of a solution of the vertical minimal equation in the interior of a convex polyhedron in H^n extending continuously to the interior of each…

We study minimum degree conditions that guarantee that an $n$-vertex graph is rigid in $\mathbb{R}^d$. For small values of $d$, we obtain a tight bound: for $d = O(\sqrt{n})$, every $n$-vertex graph with minimum degree at least $(n+d)/2 -…

An infinite graph is quasi-transitive if its vertex set has finitely many orbits under the action of its automorphism group. In this paper we obtain a structure theorem for locally finite quasi-transitive graphs avoiding a minor, which is…

A graph is called $K$-almost regular if its maximum degree is at most $K$ times the minimum degree. Erd\H{o}s and Simonovits showed that for a constant $0< \varepsilon< 1$ and a sufficiently large integer $n$, any $n$-vertex graph with more…

We consider surfaces with boundary satisfying a sixth order nonlinear elliptic partial differential equation corresponding to extremising the $L^2$-norm of the gradient of the mean curvature. We show that such surfaces with small $L^2$-norm…