Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 57 min ago
PreprintCC0arXiv

Remarks on the disjoint minimal graphs conjecture

  • Allen Weitsman
Open at sourcePDFDOICite

Abstract

It is known that there can be at most 3 disjoint nontrivial minimal graphs in R^3 with 0 boundary values, and conjectured that there can be at most 2. We explore properties that the graphs would have if there were 3.

Related

  1. On Meeks' conjecture on disjoint minimal graphs
    Angelo Benedetti, Barbara Nelli
    arXivPreprintarXiv licenceFull textGeometry & topologyarXiv
  2. Remarks on the monodromy conjecture for symmetric determinantal hypersurfaces
    Renjie Lyu, Xiping Zhang
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  3. Some remarks on Talagrand's convolution conjecture
    Alexander Shaposhnikov
    arXivPreprintarXiv licenceFull textAnalysis & PDEsProbabilityarXiv
  4. Remarks on the disproof of the unit distance conjecture
    Noga Alon, Thomas F. Bloom, W. T. Gowers +6
    arXiv (Cornell University)PreprintCC BYFull text84 citedCombinatorics & discrete mathematicsOpenAlex
  5. Spectral radius and edge-disjoint spanning trees of graphs with edge connectivity
    Jia Wei, Muhuo Liu, Zhifu You +1
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv

Cite

BibTeXRIS
BibTeX
@misc{weitsman2026remarks,
  title = {{Remarks on the disjoint minimal graphs conjecture}},
  author = {Allen Weitsman},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.15736},
  eprint = {2610.15736},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.15736},
  note = {CC0},
}
RIS
TY  - UNPB
TI  - Remarks on the disjoint minimal graphs conjecture
AU  - Allen Weitsman
PY  - 2026
DA  - 2026/10/11
PB  - arXiv
DO  - 10.48550/arxiv.2610.15736
UR  - https://arxiv.org/abs/2610.15736
AB  - It is known that there can be at most 3 disjoint nontrivial minimal graphs in R^3 with 0 boundary values, and conjectured that there can be at most 2. We explore properties that the graphs would have if there were 3.
ER  -