  For constant $r$ and arbitrary $n$, it was known that in the graph $K_r^n$
any independent set of size close to the maximum is close to some independent
set of maximum size. We prove that this statement holds for arbitrary $r$ and
$n$.
