English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

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 thatno other graph has the same deck. We prove that every tree with at least$6\ell+11$ vertices is $\ell$-reconstructible.

Trees with at least $6\ell+11$ vertices are $\ell$-reconstructible