Combinatorics of Linked Systems of Quartet Trees
  We apply classical quartet techniques to the problem of phylogenetic decisiveness and find a value $k$ such that all collections of at least $k$ quartets are decisive. Moreover, we prove that this bound is optimal and give a lower-bound on the probability that a collection of quartets is decisive. 
Emili Moan, Joseph Rusinko
q-bio.QM math.CO