We apply classical quartet techniques to the problem of phylogenetic decisiveness and find a value
such that all
collections of at least
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.