MathDB1 problem
- 0 votes0 replies2 views
Lawson–Osserman conjecture on Lipschitz solutions of the minimal graph system
Lawson–Osserman conjecture. Every Lipschitz weak solution of the minimal graph system should satisfy the full geometric Euler–Lagrange condition of graph stationarity.