@article{c3cf5c66fcdf46ceb3c944d303b80865,
title = "3-reconstructibility of rooted trees",
abstract = "A rooted tree is ℓ-reconstructible if it is determined by its multiset of rooted subtrees (with the same root) obtained by deleting ℓ vertices. We determine which rooted trees are ℓ-reconstructible for ℓ ≤ 3 and show how this can be used to study reconstructibility of unrooted trees.",
keywords = "Reconstruction Conjecture, rooted tree, ℓ-reconstructibility",
author = "Kostochka, {Alexandr V.} and Mina Nahvi and West, {Douglas B.} and Dara Zirlin",
note = "Funding Information: arXiv: 1908.01258 Received June 28, 2021. 2010 Mathematics Subject Classification: Primary 05C60; secondary 05C05. ∗Research supported by NSF grant DMS-1600592 and NSF RTG grant DMS-1937241. †Research supported by Arnold O. Beckman Campus Research Board Award RB20003 of the University of Illinois at Urbana-Champaign. ‡Research supported by National Natural Science Foundation of China grants NSFC 11871439, 11971439, and U20A2068. §Research supported by NSF RTG grant DMS-1937241 and by Arnold O. Beckman Campus Research Board Award RB20003 of the University of Illinois at Urbana-Champaign. Publisher Copyright: {\textcopyright} 2022, International Press, Inc.. All rights reserved.",
year = "2022",
doi = "10.4310/pamq.2022.v18.n6.a7",
language = "English (US)",
volume = "18",
pages = "2479--2509",
journal = "Pure and Applied Mathematics Quarterly",
issn = "1558-8599",
publisher = "International Press of Boston, Inc.",
number = "6",
}