On Reconstruction of Graphs From the Multiset of Subgraphs Obtained by Deleting ℓ Vertices

The Reconstruction Conjecture of Ulam asserts that, for n ≥ 3, every n-vertex graph is determined by the multiset of its induced subgraphs with n-1 vertices. The conjecture is known to hold for various special classes of graphs but remains wide open. We survey results on the more general conjecture by Kelly from 1957 that for every positive integer l there exists M _l (with M ₁ =3) such that when n ≥ M _l every n-vertex graph is determined by the multiset of its induced subgraphs with n- l vertices.