Disjoint minimal graphs
classification
🧮 math.DG
math.AP
keywords
disjointgraphsminimalnumberboundedcaseconjectureddomains
read the original abstract
We prove that the number s(n) of disjoint minimal graphs supported on domains in R^n is bounded by e(n+1)^2. In the two-dimensional case we show that s(2) is at most three (the conjectured number is 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.