Two dimensional disjoint minimal graphs
classification
🧮 math.DG
keywords
graphsminimalassumptionconjecturecurvaturedimensionaldisjointdisjointly
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.