← All problems

Meeks’ conjecture on disjoint minimal graphs

For every integer n≥2n\ge 2, consider pairs (u,D)(u,D) where D⊂RnD\subset\mathbb{R}^n is a domain and u ⁣:D→Ru\colon D\to\mathbb{R} is a nontrivial solution of the minimal surface equation div⁡ ⁣(∇u1+∣∇u∣2)=0\operatorname{div}\!\left(\frac{\nabla u}{\sqrt{1+|\nabla u|^2}}\right)=0 in DD, satisfying u=0u=0 on ∂D\partial D. If the corresponding minimal graphs Γu={(x,u(x)):x∈D}⊂Rn+1\Gamma_u=\{(x,u(x)):x\in D\}\subset\mathbb{R}^{n+1} are pairwise disjoint, then there are at most two such pairs (u,D)(u,D).

References

Source: arXiv

Progress summary

Refreshed
Open · progress reported

A new unrefereed paper proves the conjecture only under extra growth conditions, so the unrestricted question remains open.

Meeks’ conjecture asks whether disjoint nonplanar minimal graphs are limited in number, notably to 22 in the two-dimensional setting. The unrestricted conjecture is not settled.

Known results

  • Meeks–Rosenberg: finiteness under bounded-gradient assumptions.
  • Li–Wang: bound 2424 for two-dimensional minimal graphs in R3\mathbb{R}^3, without a growth assumption.
  • Tkachev, 2009: bound 33 using angular density.
  • Zhou, 2011: bound 22 when Gaussian curvature tends to zero at infinity, including sublinear growth.

October 2026 conditional advance

Angelo Benedetti and Barbara Nelli claim complementary growth-case results and asymptotic-angle estimates. This is progress toward Meeks’ conjecture, but the unrestricted statement remains open and the claim is unrefereed.

Current status (as of October 2026): conditional bounds and earlier partial results are known, while the unrestricted conjecture remains open.

Sources

Solutions 0

No solutions have been posted yet.