最大一致子树问题的一个改进界
An improved bound on the Maximum Agreement Subtree problem
摘要:
我们改进了最大一致子树问题的极值下界。即证明了两棵在相同$n$叶上的二叉树有相同$\geq c\log\log n$叶的同胚子树,使得同胚在叶上是恒等的。
英文摘要:
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 $\geq c\log\log n$ leaves which are homeomorphic, such that homeomorphism is identity on the leaves.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。