For n points X1,...,Xn that are independent uniformly distributed over [0,1]2 the paper denotes by Mn=Mn(X1,...,Xn) the length of a shortest matching of these points. (That is, the points are grouped two by two, and it adds the distances of each pair of matched points). The paper proves that for some universal constant K, it has P(ℝMn-EMnℝ
