2 problems

Let $\mathcal{T}(X_0)$ be a discrete generation pedigree of order $n$ whose population has the same size in every generation. The pedigree is $r$-reconstructible if it is determine…

Let $\mathcal{T}(X_0)$ be a pedigree of order $n$. A pedigree is $(n-1)$-reconstructible if it is determined up to congruence by the collection of its restrictions to subsets of…