Related papers: Compact minimal vertical graphs with non-connected…

We study the minimal surface equation in the Heisenberg space, Nil_3. A geometric proof of non existence of minimal graphs over non convex, bounded and unbounded domains is achieved (our proof holds in the Euclidean space as well). We solve…

In this paper we describe all rotation $H$-hypersurfaces in $H^n \times R$ and use them as barriers to prove existence and characterization of certain vertical $H$-graphs and to give symmetry and uniqueness results for compact…

In this paper we prove a general and sharp Asymptotic Theorem for minimal surfaces in $H^2\times R$. As a consequence, we prove that there is no properly immersed minimal surface whose asymptotic boundary $C$ is a Jordan curve homologous to…

Laurent Hauswirth and Harold Rosenberg developed the theory of minimal surfaces with finite total curvature in $\H^2\times\R$. They showed that the total curvature of one such a surface must be a non-negative integer multiple of $-2\pi$.…

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…

For $0\leq H< 1/2$, we construct entire $H$-graphs in $\mathbb{H}^2\times\mathbb{R}$ that are parabolic and not invariant by one parameter groups of isometries of $\mathbb{H}^2\times\mathbb{R}$. Their asymptotic boundaries are…

It is known that for $\Omega \subset \mathbb{R}^{2}$ an unbounded convex domain and $H>0$, there exists a graph $G\subset \mathbb{R}^{3}$ of constant mean curvature $H$ over $\Omega $ with $\partial G=$ $\partial \Omega $ if and only if…

Let $\mathbb{E}$ be a connected and orientable Riemannian 3-manifold with a non-singular Killing vector field whose associated one-parameter group of the isometries of $\mathbb{E}$ acts freely and properly on $\E$. Then, there exists a…

We state a sufficient condition for the square of a locally finite graph to contain a Hamilton circle, extending a result of Harary and Schwenk about finite graphs. We also give an alternative proof of an extension to locally finite graphs…

In 1962, Erd\H{o}s proved that if a graph $G$ with $n$ vertices satisfies $$ e(G)>\max\left\{\binom{n-k}{2}+k^2,\binom{\lceil(n+1)/2\rceil}{2}+\left\lfloor \frac{n-1}{2}\right\rfloor^2\right\}, $$ where the minimum degree $\delta(G)\geq k$…

In this paper we study the non-existence of solutions to the Dirichlet problem for minimal graphs of codimension $\geq 2$, including certain situations over domain $\Omega$ even with non-$C^1$ boundary $\partial \Omega$.

We study the Dirichlet problem for minimal surface systems in arbitrary dimension and codimension via mean curvature flow, and obtain the existence of minimal graphs over arbitrary mean convex bounded $C^2$ domains for a large class of…

We study unknottedness for free boundary minimal surfaces in a three-dimensional Riemannian manifold with nonnegative Ricci curvature and strictly convex boundary, and for self-shrinkers in the three-dimensional Euclidean space. For doing…

In this paper, we study the problem of determining the maximum number of edges in an $n$-vertex $r$-uniform hypergraph that contains no $(k+1)$-connected subgraph. The graph case is a classical problem initiated by Mader, central to graph…

A simple topological graph is a topological graph in which any two edges have at most one common point, which is either their common endpoint or a proper crossing. More generally, in a k-simple topological graph, every pair of edges has at…

In the distributed subgraph-freeness problem, we are given a graph $H$, and asked to determine whether the network graph contains $H$ as a subgraph or not. Subgraph-freeness is an extremely local problem: if the network had no bandwidth…

The purpose of this paper is to prove some results on the absence of bound states for certain nonlinear Schr\"odinger equations on noncompact metric graphs with localized nonlinearity. In particular, we show how the topological and metric…

Twin-width is a recently introduced graph parameter for finite graphs. It is an open problem to determine whether there is an $n$-vertex graph having twin-width at least $n/2$ (due to J. Ahn, K. Hendrey, D. Kim and S. Oum). In an earlier…

In contrast to the usual quantum systems which have at most a finite number of open spectral gaps if they are periodic in more than one direction, periodic quantum graphs may have gaps arbitrarily high in the spectrum. This property of…

We investigate locally $n \times n$ grid graphs, that is, graphs in which the neighbourhood of any vertex is the Cartesian product of two complete graphs on $n$ vertices. We consider the subclass of these graphs for which each pair of…