ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let PP be a set of nn points in the plane. Write w(P)w(P) for the length of a Euclidean minimum spanning tree of PP, and let

γ(P)=max⁡P=R∪Bw(R)+w(B)w(P),\gamma(P)=\max_{P=R\cup B}\frac{w(R)+w(B)}{w(P)},

where the maximum is over all non-trivial bipartitions of PP into two sets. Six-point MST-ratio conjecture. For any set PP of n≥6n\geq 6 points in the plane, we have γ(P)>1\gamma(P)>1. This would improve the paper's established guarantee from n≥12n\geq 12 to n≥6n\geq 6; 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.