We show that there are graphs G and H which satisfy: (I) for every integer n, H contains n disjoint graphs each isomorphic to G, and (II) H does not contain infinitely many disjoint graphs each isomorphic to G. This answers one of the questions raised by Halin in the Graph Theory Newsletter.