Caterpillars with $n$ vertices are reconstructible from subgraphs with at most $n/2+1$ vertices

Alexandr V. Kostochka, Zishen Qu, Maddy Ritter +1

The $\textit{$m$-deck}$ of an $n$-vertex graph is the multiset of unlabeled induced subgraphs with $m$ vertices. Caterpillars are trees in which all nonleaf vertices lie on a singl…