Acyclic graphs with at least $2\ell +1$ vertices are $\ell$-recognizable

Alexandr V. Kostochka, Mina Nahvi, Douglas B. West +1

The $(n-\ell )$-deck of an $n$-vertex graph is the multiset of subgraphs obtained from it by deleting $\ell$ vertices. A family of $n$-vertex graphs is $\ell$-recognizable if every…