Random planar bipartite-coloring approximation conjecture

Let $P_n$ consist of $n$ independent random points uniformly distributed in $[0,1]^2$, and let a bipartite coloring of $P_n$ be any coloring induced by a Euclidean minimum spanning tree. Random bipartite-coloring approximation conjecture. The maximum EMST-ratio is less than $1.1$ times any bipartite EMST-ratio of the point set with probability tending to $1$ as $n$ goes to infinity.

Computational experiments reported in the source found that the maximum EMST-ratio was at most $1.3$ times, and rarely more than $1.1$ times, the computed bipartite EMST-ratio for the tested random point sets. The asymptotic claim remains open.