Optimally reconstructing caterpillars

For a graph $G$, the $\ell$-deck of $G$ is the multiset of induced subgraphs on $G$ having $\ell$ vertices. Recently, Groenland et al. proved that any tree can be reconstructed from its $(8/9+o(1))n$-deck. For the particular case of caterpillar graphs, we show that the $(1/2+o(1))n$-deck suffices, w...

Ausführliche Beschreibung

Bibliographische Detailangaben

1. Verfasser:	Hunter, Zach
Format:	Artikel
Sprache:	eng
Schlagworte:	Mathematics - Combinatorics
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!