Vol. 257, No. 2, 2012

Download this article
Download this article. For screen
For printing
Recent Issues
Vol. 332: 1  2
Vol. 331: 1  2
Vol. 330: 1  2
Vol. 329: 1  2
Vol. 328: 1  2
Vol. 327: 1  2
Vol. 326: 1  2
Vol. 325: 1  2
Online Archive
Volume:
Issue:
     
The Journal
About the journal
Ethics and policies
Peer-review process
 
Submission guidelines
Submission form
Editorial board
Officers
 
Subscriptions
 
ISSN 1945-5844 (electronic)
ISSN 0030-8730 (print)
 
Special Issues
Author index
To appear
 
Other MSP journals
Two-dimensional disjoint minimal graphs

Linfeng Zhou

Vol. 257 (2012), No. 2, 503–510
Abstract

Under the assumption of Gauss curvature vanishing at infinity, we prove Meeks’ conjecture: the number of disjointly supported minimal graphs in 3 is at most two.

Keywords
minimal graphs, Meeks conjecture
Mathematical Subject Classification 2010
Primary: 53C42, 53C21
Milestones
Received: 27 June 2011
Revised: 14 November 2011
Accepted: 28 March 2012
Published: 4 July 2012
Authors
Linfeng Zhou
Department of Mathematics
East China Normal University
Shanghai 200241
China