Perfect matchings in random intersection graphs

Let W ₁,??,W _n be independent random subsets of [m]={1,??,m}. Assuming that each W _i is uniformly distributed in the class of d-subsets of?[m] we study the uniform random intersection graph G _s (n,m,d) on the vertex set {W ₁,??W _n }, defined by the adjacency relation: W _i ??W _j whenever |W _i ??W _j |?Rs. For even?n we show that as n,m???? the edge density threshold for the property that G _s (n,m,d) contains a perfect matching is asymptotically the same as that for G _s (n,m,d) being connected.