Related papers: CMC Graphs With Planar Boundary in $\mathbb{H}^{2}…

We introduce a notion of curvature on finite, combinatorial graphs. It can be easily computed by solving a linear system of equations. We show that graphs with curvature bounded below by $K>0$ have diameter bounded by $\mbox{diam}(G) \leq…

In this paper we study constant mean curvature surfaces $\Sigma$ in a product space, $\mathbb{M}^2\times \mathbb{R}$, where $\mathbb{M}^2$ is a complete Riemannian manifold. We assume the angle function $\nu = \meta{N}{\partial_t}$ does not…

A proper subdomain $G$ of the unit disk $\mathbb{D}$ is horocyclically convex (horo-convex) if, for every $\omega \in \mathbb{D}\cap \partial G$, there exists a horodisk $H$ such that $\omega \in \partial H$ and $G\cap H=\emptyset$. In this…

We establish the well-posedness of the nonlocal mean curvature flow of order ${\alpha\in(0,1)}$ for periodic graphs on $\mathbb{R}^n$ in all subcritical little H\"older spaces ${\rm h}^{1+\beta}(\mathbb{T}^n)$ with $\beta\in(0,1)$.…

In this paper, we prove a half-space theorem with respect to constant mean curvature $1/2$ entire graphs in $\mathbb{E(-1,\tau)}$. If $\Sigma$ is such an entire graph and $\Sigma'$ is a properly immersed constant mean curvature $1/2$…

We use a randomised embedding method to prove that for all \alpha>0 any sufficiently large oriented graph G with minimum in-degree and out-degree \delta^+(G),\delta^-(G)\geq (3/8+\alpha)|G| contains every possible orientation of a Hamilton…

We investigate the two problems of computing the union join graph as well as computing the subset graph for acyclic hypergraphs and their subclasses. In the union join graph $G$ of an acyclic hypergraph $H$, each vertex of $G$ represents a…

In this paper, we study the outerplanarity of planar graphs, i.e., the number of times that we must (in a planar embedding that we can initially freely choose) remove the outerface vertices until the graph is empty. It is well-known that…

We address the question of attainability of the best constant in the following Hardy-Sobolev inequality on a smooth domain $\Omega$ of \mathbb{R}^n: $$ \mu_s (\Omega) := \inf \{\int_{\Omega}| \nabla u|^2 dx; u \in {H_{1,0}^2(\Omega)}…

Median graphs are connected graphs in which for all three vertices there is a unique vertex that belongs to shortest paths between each pair of these three vertices. In this paper we provide several novel characterizations of planar median…

Let $G=(V,E)$ be a finite, connected graph. We investigate a notion of boundary $\partial G \subseteq V$ and argue that it is well behaved from the point of view of potential theory. This is done by proving a number of discrete analogous of…

The square of a graph $G$, denoted $G^2$, has the same vertex set as $G$ and has an edge between two vertices if the distance between them in $G$ is at most $2$. Thomassen [12] showed that $\chi(G^2) \leq 7$ if $G$ is a subcubic planar…

For a bounded domain $\Omega\subset\mathbb{R}^m, m\geq 2,$ of class $C^0$, the properties are studied of fields of `good directions', that is the directions with respect to which $\partial\Omega$ can be locally represented as the graph of a…

We construct non-zero constant mean curvature H surfaces in the product spaces $\mathbb{S}^2 \times \mathbb{R}$ and $\mathbb{H}^2\times \mathbb{R}$ by using suitable conjugate Plateau constructions. The resulting surfaces are complete, have…

We prove a phenomenon of concentration of total curvature for stable minimal surfaces in the product space H^2xR; where H^2 is the hyperbolic plane. Under some geometric conditions on the asymptotic boundary of an oriented stable minimal…

We study the existence and construction of sparse supports for hypergraphs derived from subgraphs of a graph $G$. For a hypergraph $(X,\mathcal{H})$, a support $Q$ is a graph on $X$ s.t. $Q[H]$, the graph induced on vertices in $H$ is…

For any fixed graph $G$, the subgraph isomorphism problem asks whether an $n$-vertex input graph has a subgraph isomorphic to $G$. A well-known algorithm of Alon, Yuster and Zwick (1995) efficiently reduces this to the "colored" version of…

Let $M$ be a Hadamard manifold with curvature bounded above by a negative constant $-\alpha$, satisfying the "strict convexity condition", and assume that $M$ admits a "helicoidal" one-parameter subgroup $G$ of isometries of $M$. Then,…

A graph is $1$-planar if it has a drawing in the plane such that each edge is crossed at most once by another edge. Moreover, if this drawing has the additional property that for each crossing of two edges the end vertices of these edges…

Given a (di)graph $H$, we say that a (di)graph $H^\prime$ is an $H$-subdivision if $H^\prime$ is obtained from $H$ by replacing one or more edges with internally vertex-disjoint path(s). Pavez-Sign\'{e} conjectured that for every…