相关论文: Bernstein type theorem for entire weighted minimal…

Answering a question of Diestel, we develop a topological notion of gammoids in infinite graphs which, unlike traditional infinite gammoids, always define a matroid. As our main tool, we prove for any infinite graph $G$ with vertex sets $A$…

We derive estimates of the Hessian of two smooth functions defined on Grassmannian manifold. Based on it, we can derive curvature estimates for minimal submanifolds in Euclidean space via Gauss map. In this way, the result for Bernstein…

We derive a Bernstein type result for the special Lagrangian equation, namely, any global convex solution must be quadratic. In terms of minimal surfaces, the result says that any global minimal Lagrangian graph with convex potential must…

In this paper, we prove some rigidity theorems for the entire 2-convex solutions of 2-Hessian equation in Euclidean space. As an application, we obtain a Bernstein type theorem for global special Lagrangian graphs.

We prove a discrete Gauss-Bonnet-Chern theorem which states where summing the curvature over all vertices of a finite graph G=(V,E) gives the Euler characteristic of G.

We obtain necessary conditions for the existence of complete vertical graphs of constant mean curvature in the Hyperbolic and Steady State spaces. In the two-dimensional case we prove Bernstein-type results in each of these ambient spaces.

A cornerstone theorem in the Graph Minors series of Robertson and Seymour is the result that every graph $G$ with no minor isomorphic to a fixed graph $H$ has a certain structure. The structure can then be exploited to deduce far-reaching…

A proof based on the Chern-Gauss-Bonnet Theorem is given to Hopf Theorem concerning the degree of the Gauss map of a hypersurface in $\mathbb{R}^n$.

Working in any model theoretic structure, we single out a class of definable bipartite graphs that admit definable, close to perfect matchings. We use this result to prove a strengthening of Tarski's theorem for the definable setting.

Menger's Theorem is a fundamental result in graph theory. It states that if in a graph $G$ with distinguished sets of terminal vertices $S$ and $T$ there are no $k$ pairwise vertex-disjoint $S$-$T$ paths, then there is a set of less than…

It is shown that for a subset $A\subset\R^n$ that has the global Gabrielov property, a Vitushkin-type estimate holds. Concrete examples are given for sub-level sets of certain classes of functions.

The theorem is proved that generalizes the Gelfand generalization of the Paley-Wiener tauberian theorem to general abelian topological semigroups with invariant measure. Several corollaries of this theorem are given.

In this paper, we prove two Liouville-type theorems for capillary minimal graph over $\mathbb{R}^n_+$. First, if $u$ has linear growth, then for $n=2,3$ and for any $\theta\in(0,\pi)$, or $n\geq4$ and $\theta\in(\frac{\pi}6,\frac{5\pi}6)$,…

It is well-known that a minimal graph of codimension one is stable, i.e. the second variation of the area functional is non-negative. This is no longer true for higher codimensional minimal graphs. In this note, we prove that a minimal…

A total weighting of a graph $G$ is a mapping $f$ which assigns to each element $z \in V(G) \cup E(G)$ a real number $f(z)$ as its weight. The vertex sum of $v$ with respect to $f$ is $\phi_f(v)=\sum_{e \in E(v)}f(e)+f(v)$. A total…

We propose a simple proof of the vertical half-space theorem for Heisenberg space.

We identify a region $\Bbb{W}_{\f{1}{3}}$ in a Grassmann manifold $\grs{n}{m}$, not covered by a usual matrix coordinate chart, with the following important property. For a complete $n-$submanifold in $\ir{n+m} \, (n\ge 3, m\ge2)$ with…

A graph $A$ is "apex" if $A-z$ is planar for some vertex $z\in V(A)$. Eppstein [Algorithmica, 2000] showed that for a minor-closed class $\mathcal{G}$, the graphs in $\mathcal{G}$ with bounded radius have bounded treewidth if and only if…

The conjecture of Bollob\'as and Koml\'os, recently proved by B\"ottcher, Schacht, and Taraz [Math. Ann. 343(1), 175--205, 2009], implies that for any $\gamma>0$, every balanced bipartite graph on $2n$ vertices with bounded degree and…

A $biased\ graph$ is a pair $(G,\mathcal{B})$, where $G$ is a graph and $\mathcal{B}$ is a collection of `balanced' circuits of $G$ such that no $\Theta$-subgraph of $G$ contains precisely two balanced circuits. We prove a Ramsey-type…