On the solution of the random link matching problems

Abstract
We show that the replica symmetric solution of the matching problem (bipartite or not) with independent random distances is stable. We compute the fluctuations and get the O (1/N) corrections to the length of the optimal matching in a generic sample