Disjoint minimal graphs

Original Paper

DOI: 10.1007/s10455-008-9127-7

Cite this article as:
Tkachev, V.G. Ann Glob Anal Geom (2009) 35: 139. doi:10.1007/s10455-008-9127-7


We prove that the number s(n) of disjoint minimal graphs supported on domains in \({\mathbb{R}^{n}}\) is bounded by e(n + 1)2. In the two-dimensional case, we show that s(2) ≤ 3.


Minimal graphs Angular density Fundamental frequency 

Copyright information

© Springer Science+Business Media B.V. 2008

Authors and Affiliations

  1. 1.Royal Institute of TechnologyStockholmSweden

Personalised recommendations