相关论文: Level Curves of Minimal Graphs

We establish a maximum principle for a two-point function in order to analyze the convexity of level sets of harmonic functions. We show that this can be used to prove a strict convexity result involving the smallest principal curvature of…

A graph $G$ with four or more vertices is called bicritical if the removal of any pair of distinct vertices of $G$ results in a graph with a perfect matching. A bicritical graph is minimal if the deletion of each edge results in a…

A matching covered graph $G$ is minimal if for each edge $e$ of $G$, $G-e$ is not matching covered. An edge $e$ of a matching covered graph $G$ is removable if $G-e$ is also matching covered. Thus a matching covered graph is minimal if and…

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…

In this note, we derive a uniqueness theorem for minimal graphs of general codimension under certain restrictions closed related to the convexity (not strict convexity) of the area functional with respect to singular values, improving the…

Minimal prime graphs are connected graphs on at least two vertices whose complements satisfy the following conditions: triangle-freeness, 3-colorability, and edge-maximality with respect to the latter two properties. These graphs are prime…

A graph $G$ is minimally $t$-tough if the toughness of $G$ is $t$ and the deletion of any edge from $G$ decreases the toughness. Kriesell conjectured that for every minimally $1$-tough graph the minimum degree $\delta(G)=2$. We show that in…

We consider the motion by mean curvature of an $n$-dimensional graph over a time-dependent domain in $\mathbb{R}^n$, intersecting $\mathbb{R}^n$ at a constant angle. In the general case, we prove local existence for the corresponding…

We discuss upper and lower bounds for the size of gaps in the length spectrum of negatively curved manifolds. For manifolds with algebraic generators for the fundamental group, we establish the existence of exponential lower bounds for the…

We give sharp bounds for the hyperbolic curvature of the level curve $|z|=|f(z)|$, when $f:\mathbb{D}\to\mathbb{D}$ is holomorphic on the unit disc $\mathbb{D}$ and $f(0)\neq0$, as well as for other related level curves. As a consequence,…

The dominating graph of a graph G is a graph whose vertices correspond to the dominating sets of G and two vertices are adjacent whenever their corresponding dominating sets differ in exactly one vertex. Studying properties of dominating…

The purpose of this paper is to study low degree points on plane curves. We prove results analogous to those of Debarre and Klassen for singular plane curves with a finite number $\delta$ of ordinary nodes/cusps, where $\delta$ is bounded…

Based on earlier work by Carlen-Maas and the second- and third-named author, we introduce the notion of intertwining curvature lower bounds for graphs and quantum Markov semigroups. This curvature notion is stronger than both Bakry-\'Emery…

This paper proves that classical minimal surfaces of arbitrary topological type with total boundary curvature at most 4\pi must be smoothly embedded. Related results are proved for varifolds and for soap film surfaces.

In a previous work of the authors, a result to algorithmically compute the topology types of the level curves of an algebraic surface, is given. From this result, here we derive applications based on level curves to determine some…

For the $p$-harmonic function with strictly convex level sets, we find a test function which comes from the combination of the norm of gradient of the $p$-harmonic function and the smallest principal curvature of the level sets of…

An interesting problem in classical differential geometry is to find methods to prove that two surfaces defined by different charts actually coincide up to position in space. In a previous paper we proposed a method in this direction for…

We study a set of scattering matrices of quantum graphs containing minimal number of passbands, i.e., maximal number of zero elements. The cases of even and odd vertex degree are considered. Using a solution of inverse scattering problem,…

A connected graph $G$ with a perfect matching is said to be $k$-extendable for integers $k$, $1 \leq k\leq \frac{|V(G)|}{2}-1$, if any matching in $G$ of size $k$ is contained in a perfect matching of $G$. A $k$-extendable graph is minimal…

In communication field, an important issue is to group users and base stations to as many as possible subnetworks satisfying certain interference constraints. These problems are usually formulated as a graph partition problems which…