Treelike quintet systems
classification
🧮 math.CO
keywords
amalgamatedchoosecriterionequalexistsfinitegiveleaf
read the original abstract
Let $X$ be a finite set. We give criterion to say if a system of trees ${\cal P}=\{T_i\}_i$ with leaf sets $L(T_i) \in {X \choose 5}$ can be amalgamated into a supertree, that is, if there exists a tree $T$ with $L(T)=X$ such that $T$ restricted to $ L(T_i)$ is equal to $T_i$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.