Trees with at least $6\ell+11$ vertices are $\ell$-reconstructible
Combinatorics
2023-07-20 v1
Abstract
The -deck of an -vertex graph is the multiset of (unlabeled) subgraphs obtained from it by deleting vertices. An -vertex graph is -reconstructible if it is determined by its -deck, meaning that no other graph has the same deck. We prove that every tree with at least vertices is -reconstructible.
Cite
@article{arxiv.2307.10035,
title = {Trees with at least $6\ell+11$ vertices are $\ell$-reconstructible},
author = {Alexandr V. Kostochka and Mina Nahvi and Douglas B. West and Dara Zirlin},
journal= {arXiv preprint arXiv:2307.10035},
year = {2023}
}