We 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 ≥cloglogn leaves which are homeomorphic, such that homeomorphism is identity on the leaves.
Cite
@article{arxiv.0903.3386,
title = {An improved bound on the Maximum Agreement Subtree problem},
author = {Laszlo Szekely and Mike Steel},
journal= {arXiv preprint arXiv:0903.3386},
year = {2009}
}