4 problems

Let two rooted balanced phylogenetic trees have the same leaf set of size $n$. Martin–Thatte conjecture. The two trees must agree on at least … leaves. This conjecture concerns the…

Let ${\mathcal S}$ and ${\mathcal T}$ be balanced rooted binary phylogenetic $X$-trees, meaning that each has $2^m$ leaves for some non-negative integer $m$ and height $m$, and let…

Let $T_1$ and $T_2$ be binary phylogenetic trees with the same leaf-set, and let a maximum agreement subtree be a largest common subtree on a subset of their leaves. In the balance…

Let $T_1$ and $T_2$ be balanced, rooted, binary trees of height $m$. An agreement subtree is a common subtree of the two trees on a shared set of leaves. The square-root agreement-…