ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let S{\mathcal S} and T{\mathcal T} be balanced rooted binary phylogenetic XX-trees, meaning that each has 2m2^m leaves for some non-negative integer mm and height mm, and let n=∣X∣n=|X|. Write mast(S,T){\rm mast}({\mathcal S},{\mathcal T}) for the maximum size of a common restriction that is an agreement subtree of S{\mathcal S} and T{\mathcal T}. Martin and Thatte's conjecture.

mast(S,T)≥n12.{\rm mast}({\mathcal S},{\mathcal T})\geq n^{\frac12}.

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 c>0c>0, balanced rooted binary trees with maximum agreement subtree of size less than cn12c n^{\frac12}; 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.