Disjoint minimal graphs
From MaRDI portal
Publication:1024791
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).
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; zbMATH DE number 5531984
- Graph minors and linkages
Cites work
- scientific article; zbMATH DE number 4044625 (Why is no real title available?)
- scientific article; zbMATH DE number 3255933 (Why is no real title available?)
- scientific article; zbMATH DE number 3280665 (Why is no real title available?)
- Ahlfors and conformal invariants
- Denjoy-Ahlfors theorem for harmonic functions on Riemannian manifolds and external structure of minimal surfaces
- Finiteness of disjoint minimal graphs
- Finiteness of the number of ends of minimal submanifolds in Euclidean space
- Parabolicity, projective volume and finiteness of total curvature of minimal surfaces
- TWO-DIMENSIONAL MINIMAL GRAPHS OVER UNBOUNDED DOMAINS
- The uniqueness of the helicoid
Cited in
(6)- Minimal graphs in \(M \times \mathbb{R}\)
- scientific article; zbMATH DE number 1501844 (Why is no real title available?)
- MINIMAL GRAPHS WITH DISCONTINUOUS BOUNDARY VALUES
- Disjoint unions of complete minors
- The classical theory of minimal surfaces
- Minimal graphs for contractible and dismantlable properties
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)
