We prove that the set edge-reconstruction conjecture is true for graphs with at most two graphs in the set of edge-deleted subgraphs.