The finite-character-subset conjecture for perfect phylogenies
Statement
Let be a finite set of taxa. An -state character on is a partition of into at most states. A set of characters is compatible if there is a tree on that displays every character in ; such a tree is a perfect phylogeny for .
Finite-character-subset conjecture. For each positive integer , there exists an integer such that, for any finite set and any set of -state characters on , is compatible if and only if every subset of at most characters in is compatible.
This conjecture formalizes the question of whether compatibility can always be determined by checking character subsets of bounded size, independently of the total number of characters. The paper states that the conjecture is false, so it is refuted.
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.