title: An improved bound on the Maximum Agreement Subtree problem.
abstract: 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 ≥ c log log n leaves which are homeomorphic, such that homeomorphism is identity on the leaves.
authors.affiliation: Biomathematics Research Centre, University of Canterbury, New Zealand, M.Steel@math.canterbury.ac.nz.
authors.forename: Mike
authors.initials: M
authors.lastname: Steel
authors.forename: László A
authors.initials: LA
authors.lastname: Székely