Skip to content

Remarks on the disjoint minimal graphs conjecture

Allen Weitsman

math.DGarXiv:2610.15736

Abstract

It is known that there can be at most 3 disjoint nontrivial minimal graphs in R3 with 0 boundary values, and conjectured that there can be at most 2. We explore properties that the graphs would have if there were 3.

Create a lesson