We study several combinatorial problems related to the choice of groups of subsets to be used in the subsampling procedure of Hartigan (J. Amer. Statist. Assoc. 1969). The complete separation property is shown to guarantee asymptotic efficiency relative to $t$. Problems associated with the relative variance criterion are discussed.