Next we require a version of the Rödl nibble which gives a spread distribution over nearly complete hypergraph matchings in a dense situation. We sketch a short proof based on applying the Rödl nibble given in [1]} to a harshly subsampled random hypergraph.
