Claw-free graphs are edge reconstructible

The Edge Reconstruction Conjecture states that all graphs with at least four edges are determined by their edge-deleted subgraphs. We prove that this is true for claw-free graphs, those graphs with no induced subgraph isomorphic to K1,3. This includes line graphs as a special case.