The six-point MST-ratio conjecture for planar point sets
Statement
Let be a set of points in the plane. Write for the length of a Euclidean minimum spanning tree of , and let
where the maximum is over all non-trivial bipartitions of into two sets. Six-point MST-ratio conjecture. For any set of points in the plane, we have . This would improve the paper's established guarantee from to ; the conjecture is presented as an open question in the source.
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.