AlexandrKostochka

A graph or graph property is $\ell$-reconstructible if it is determined by the multiset of all subgraphs obtained by deleting $\ell$ vertices. Apart from the famous Graph Reconstruction Conjecture, Kelly conjectured in 1957 that for each $\ell \in \mathbb{N}$, there is an integer $n=n(\ell )$ such that every graph with at least $n$ vertices is $\ell$-reconstructible. We show that for …