Disjoint minimal graphs
From MaRDI portal
Publication:1024791
DOI10.1007/S10455-008-9127-7zbMATH Open1171.53012arXiv0807.3694OpenAlexW3100194994MaRDI QIDQ1024791FDOQ1024791
Authors: V. G. Tkachev 
Publication date: 17 June 2009
Published in: Annals of Global Analysis and Geometry (Search for Journal in Brave)
Abstract: 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 conjectured number is two).
Full work available at URL: https://arxiv.org/abs/0807.3694
Recommendations
- Two-dimensional disjoint minimal graphs
- Finiteness of disjoint minimal graphs
- Minimal graphs with disjoint dominating and paired-dominating sets
- Minimal indecomposable graphs
- MINIMAL GRAPHS WITH DISCONTINUOUS BOUNDARY VALUES
- scientific article; zbMATH DE number 1792660
- scientific article; zbMATH DE number 4038604
- Graph minors. VI. Disjoint paths across a disc
- scientific article
- Graph minors and linkages
Cites Work
- Title not available (Why is that?)
- The uniqueness of the helicoid
- Finiteness of the number of ends of minimal submanifolds in Euclidean space
- Finiteness of disjoint minimal graphs
- Denjoy-Ahlfors theorem for harmonic functions on Riemannian manifolds and external structure of minimal surfaces
- Ahlfors and conformal invariants
- TWO-DIMENSIONAL MINIMAL GRAPHS OVER UNBOUNDED DOMAINS
- Parabolicity, projective volume and finiteness of total curvature of minimal surfaces
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (6)
This page was built for publication: Disjoint minimal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024791)
