Title: Determination of the edge set of regular graphs as intersections of perfect matchings

Abstract: We show that the edges of an r-regular graph G can be uniquely determined by the intersection of k perfect matchings of G if and only if k=1 and G is graph on two vertices which are connected by r edges or r=3 and k=2 and G is the Petersen graph.