arXiv (All)
open access
A short proof of Bernstein's theorem via the Omori--Yau maximum principle
We give a short, self-contained proof of Bernstein's theorem: every entire minimal graph in $R^3$ is a plane. The only global tool is the Omori-Yau maximum principle, which holds on entire minimal graphs with their induced metric. We apply it exactly once to a single explicit function $F$ built from
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Max Independent Set Remains NP-hard when Excluding a Planar Induced Minor#998825
- Multiset Metric Dimension of Binomial Random Graphs#924439
- Multiset Metric Dimension of Binomial Random Graphs#920208
- On minimal regular graphs with given constraintsm#1041667
- Extremal hypergraphs without generalized 4-cycles#1142055
Record · ID 1118716
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive