Two-dimensional disjoint minimal graphs

DOI10.2140/PJM.2012.257.503zbMATH Open1278.53067arXiv1108.5313OpenAlexW2028689199MaRDI QIDQ448925FDOQ448925

Authors: Linfeng Zhou 

Publication date: 11 September 2012

Published in: Pacific Journal of Mathematics (Search for Journal in Brave)

Abstract: In this paper, under the assumption of Gauss curvature vanishing at infinity, we will prove Meeks' conjecture: the number of disjointly supported minimal graphs in $mathbb{R}^3$ is at most two.

Full work available at URL: https://arxiv.org/abs/1108.5313

Recommendations

• Finiteness of higher codimensional disjoint minimal graphs
• Finiteness of disjoint minimal graphs
• Minimal graphs in \(M \times \mathbb{R}\)
• TWO-DIMENSIONAL MINIMAL GRAPHS OVER UNBOUNDED DOMAINS
• Gaussian curvature of minimal graphs in \(M \times \mathbb{R} \)

zbMATH Keywords

asymptotic estimatesMeeks' conjectureminimal graph

Mathematics Subject Classification ID

Methods of global Riemannian geometry, including PDE methods; curvature restrictions (53C21) Differential geometry of immersions (minimal, prescribed curvature, tight, etc.) (53C42)

Cited In (7)

• MINIMAL GRAPHS WITH DISCONTINUOUS BOUNDARY VALUES
• Title not available (Why is that?)
• Characterization of \(2\)-minimally nonouterplanar join graphs
• Finiteness of disjoint minimal graphs
• Finiteness of higher codimensional disjoint minimal graphs
• Minimal regular 2-graphs and applications
• Disjoint minimal graphs

This page was built for publication: Two-dimensional disjoint minimal graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q448925)