A quartet is consistent with a binary tree$T$ if the removal of some edge from $T$
results in two subtrees, each containing one of the two subsets of the quartet.
We say that a collection of quartets is consistent if there exists some binary tree
with which every quartet in the collection is consistent.
