Existence of planar minimal graphs with arbitrarily many vertices
Statement
A minimal graph is a planar graph attached to a finite set of points in the plane and minimizing the relevant length functional. Fix a finite set of attaching points.
Existence conjecture. There exist minimal graphs attached to some fixed finite set of points in the plane with arbitrarily large numbers of vertices.
Weighted minimal graphs, including the spider web-like varifolds of Allard and Almgren, motivate this conjecture. If true, it would lead naturally to the study of infinite minimal graphs and Morse theory in spaces of -cycles with infinitely many edges; the supplied text does not state whether the conjecture is resolved.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.