Highly Influenced

# Finiteness of Disjoint Minimal Graphs

@inproceedings{Li2001FinitenessOD, title={Finiteness of Disjoint Minimal Graphs}, author={Peter Zhi Xuan Li and Jiaping Wang}, year={2001} }

- Published 2001

of u in R is called a minimal graph supported on Ω. In a recent article of Meeks-Rosenberg [M-R], where they proved the unicity of the helicoid, the authors showed that if the defining functions {ui} of a set of disjointly supported minimal graphs {Gi} have bounded gradients, then the number of graphs must be finite. In a private communication with the first author, Rosenberg posed the question if the number of disjoint minimal graphs, whose defining functions are at most polynomial growth of a… CONTINUE READING

#### From This Paper

##### Topics from this paper.

#### Citations

##### Publications citing this paper.

#### References

##### Publications referenced by this paper.

Showing 1-3 of 3 references