2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/223883We improve the lower bound on the extremal version of the Maximum Agreement Subtree problem. Namely we prove that two binary trees on the same $n$ leaves have subtrees with the same $\geq c\log\log n$ leaves which are homeomorphic, such that homeomorphism is identity on the leaves.5 pages, 1 figurePopulations and EvolutionQuantitative Methodstext