23 citations · 220 across the 53 of their papers we have counts for
1 paper · 1 filter
Vladimir G. Tkachev
We prove that the number s(n) of disjoint minimal graphs supported on domains in R^n is bounded by e(n+1)^2. In the two-dimensional case we show that s(2) is at most three (the con…