2000 character limit reached
Trees with at least $6\ell+11$ vertices are $\ell$-reconstructible (2307.10035v1)
Published 19 Jul 2023 in math.CO
Abstract: The $(n-\ell)$-deck of an $n$-vertex graph is the multiset of (unlabeled) subgraphs obtained from it by deleting $\ell$ vertices. An $n$-vertex graph is $\ell$-reconstructible if it is determined by its $(n-\ell)$-deck, meaning that no other graph has the same deck. We prove that every tree with at least $6\ell+11$ vertices is $\ell$-reconstructible.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.