| Autor: |
Kostochka, Alexandr V., Nahvi, Mina, West, Douglas B., Zirlin, Dara |
| Rok vydání: |
2023 |
| Předmět: |
|
| Druh dokumentu: |
Working Paper |
| Popis: |
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. |
| Databáze: |
arXiv |
| Externí odkaz: |
|
