Four characters suffice to convexly define a phylogenetic tree

Research output: Contribution to journalArticlepeer-review

13 Citations (Scopus)


It was recently shown that just five characters (functions on a finite set X) suffice to convexly define a trivalent tree with leaf set X. Here we show that four characters suffice which, since three characters are not enough in general, is the best possible.
Original languageEnglish
Pages (from-to)835-843
Number of pages9
JournalSIAM Journal on Discrete Mathematics
Issue number4
Publication statusPublished - 2005

Cite this