Martin and Thatte's maximum agreement subtree conjecture for balanced trees
Statement
Let and be balanced rooted binary phylogenetic -trees, meaning that each has leaves for some non-negative integer and height , and let . Write for the maximum size of a common restriction that is an agreement subtree of and . Martin and Thatte's conjecture.
The conjecture proposed a square-root lower bound for the size of a maximum agreement subtree of two balanced rooted binary phylogenetic trees. It is refuted by the paper's main theorem, which gives, for every , balanced rooted binary trees with maximum agreement subtree of size less than ; hence the conjecture is false.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.