The six-point MST-ratio conjecture for planar point sets
The six-point MST-ratio conjecture for planar point sets
From papers
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.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Adrian Dumitrescu, János Pach and Géza Tóth, “Two trees are better than one”, arXiv:2312.09916 (2023).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.