English
Related papers

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

200 papers

For a mean curvature flow of complete graphical hypersurfaces $M_{t}=\operatorname{graph} u(\cdot,t)$ defined over domains $\Omega_{t}$, the enveloping cylinder is $\partial\Omega_{t}\times\mathbb{R}$. We prove the smooth convergence of…

Differential Geometry · Mathematics 2021-04-02 Wolfgang Maurer

Let $G$ be an $n$-vertex graph, where $\delta(G) \geq \delta n$ for some $\delta := \delta(n)$. A result of Bohman, Frieze and Martin from 2003 asserts that if $\alpha(G) = O \left(\delta^2 n \right)$, then perturbing $G$ via the addition…

Combinatorics · Mathematics 2022-06-27 Elad Aigner-Horev , Dan Hefetz , Michael Krivelevich

We study the Dirichlet problem for a graph $\Sigma$ in $\mathbb{R}^{n+1}$ with normalized constant mean curvature $H>0$ and planar boundary $\Gamma=\partial \Omega$. Our main result is that the optimal solvability condition, namely that the…

Differential Geometry · Mathematics 2020-04-21 Joel Spruck , Liming Sun

The {\em square} of a graph $G$, denoted $G^2$, has the same vertex set as $G$ and an edge between any two vertices at distance at most $2$ in $G$. Wegner (1977) conjectured that for a planar graph $G$, $\chi(G^2) \leq 7$ if $\Delta(G) =…

Combinatorics · Mathematics 2025-12-12 Seog-Jin Kim , Rong Luo

We show that constant mean curvature hypersurfaces in $\mathbb H^n\times\mathbb R$, with small and pinched boundary contained in a horizontal slice $P$ are topological disks, provided they are contained in one of the two halfspaces…

Differential Geometry · Mathematics 2021-10-11 Barbara Nelli , Giuseppe Pipoli

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…

Analysis of PDEs · Mathematics 2008-12-10 Alexandre Freire

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…

Analysis of PDEs · Mathematics 2008-05-30 Alex Freire

In this paper we consider a mean curvature flow $V=H+A$ in a high dimensional cylinder $\Omega\times \R$, where, $A$ is a constant, $\Omega$ is a bounded domain in $\R^n$, and, for a hypersurface $y=u(x,t)$ over $\Omega$, $V$ and $H$ denote…

Differential Geometry · Mathematics 2024-02-19 Zhenghuan Gao , Bendong Lou , Jinju Xu

We study the existence and uniqueness problem of compact minimal vertical graphs in $\mathbb{H}^n\times\mathbb{R}$, $n\geq 2$, over bounded domains in the slice $\mathbb{H}^n\times\{0\}$, with non-connected boundary having a finite number…

Differential Geometry · Mathematics 2014-01-22 Aline Mauricio Barbosa

In this paper, we provide upper and lower bounds on the crossing numbers of dense graphs on surfaces, which match up to constant factors. First, we prove that if $G$ is a dense enough graph with $m$ edges and $\Sigma$ is a surface of genus…

Combinatorics · Mathematics 2025-06-12 Alfredo Hubard , Arnaud de Mesmay , Hugo Parlier

We consider an anisotropic curvature flow $V= A(\mathbf{n})H + B(\mathbf{n})$ in a band domain $\Omega :=[-1,1]\times R$, where $\mathbf{n}$, $V$ and $H$ denote the unit normal vector, normal velocity and curvature, respectively, of a…

Analysis of PDEs · Mathematics 2020-02-12 Lixia Yuan , Wei Zhao

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…

Data Structures and Algorithms · Computer Science 2017-11-21 Orr Fischer , Tzlil Gonen , Rotem Oshman

The graph homomorphism problem (HOM) asks whether the vertices of a given $n$-vertex graph $G$ can be mapped to the vertices of a given $h$-vertex graph $H$ such that each edge of $G$ is mapped to an edge of $H$. The problem generalizes the…

Data Structures and Algorithms · Computer Science 2015-02-20 Fedor V. Fomin , Alexander Golovnev , Alexander S. Kulikov , Ivan Mihajlin

We consider spacelike graphs $\Gamma_f$ of simple products $(M\times N, g\times -h)$ where $(M,g)$ and $(N,h)$ are Riemannian manifolds and $f:M\to N$ is a smooth map. Under the condition of the Cheeger constant of $M$ to be zero and some…

Differential Geometry · Mathematics 2007-05-23 Isabel M. C. Salavessa

We study Hamiltonicity and pancyclicity in the graph obtained as the union of a deterministic $n$-vertex graph $H$ with $\delta(H)\geq\alpha n$ and a random $d$-regular graph $G$, for $d\in\{1,2\}$. When $G$ is a random $2$-regular graph,…

Combinatorics · Mathematics 2022-09-29 Alberto Espuny Díaz , António Girão

Given a domain $\Omega$ of $\mathbb{R}^{m+1}$ and a $k$-dimensional non-degenerate minimal submanifold $K$ of $\pa \Omega$ with $1\le k\le m-1$, we prove the existence of a family of embedded constant mean curvature hypersurfaces which as…

Analysis of PDEs · Mathematics 2007-11-15 Mouhamed Moustapha Fall , Fethi Mahmoudi

We prove an existence result for non rotational constant mean curvature ends in $\mathbb{H}^2 \times \mathbb{R}$, where $\mathbb{H}^2$ is the hyperbolic real plane. The value of the curvature is $h \, \in \, (0, 1/2)$. We use Schauder…

Analysis of PDEs · Mathematics 2013-01-22 Giovanna Citti , Cosimo Senni

In this paper, we consider the existence of constant mean curvature hypersurfaces with prescribed gradient image. Let $\Omega$ and $\tilde{\Omega}$ be uniformly convex bounded domains in $\mathbb{R}^n$ with smooth boundary. We show that…

Differential Geometry · Mathematics 2024-11-05 Rongli Huang , Dayan Wei , Yunhua Ye

Let $H$ be obtained from a cyclically $4$-edge-connected cubic planar graph $Y$ other than $K_4$ by deleting two adjacent vertices. We provide a short proof that if $H$ has circumference at least $k$ for some even integer $k \ge 4$, then…

Combinatorics · Mathematics 2026-05-12 On-Hei Solomon Lo

In a graph $G$, a vertex dominates itself and its neighbors. A subset $S\subseteq V(G)$ is said to be a double dominating set of $G$ if $S$ dominates every vertex of $G$ at least twice. The double domination number $\gamma_{\times 2}(G)$ is…

Combinatorics · Mathematics 2021-07-08 Wei Zhuang