Concentration of the hypergraph's weak independence number

Abstract

In this note we generalize the results of the recent work by Tom Bohman and Jacob Hofstad on the independence number in G(n, p) to the case of the random k-uniform hypergraph. Concentration in two values occurs in the regime $p>n^{-(k-1)k/(k+1)+\epsilon }$.

Update after journal review, simplification of one of the lemmas